Summary: Incremental Constructions con BRIO
Nina Amenta
Computer Science Department
University of California at Davis
amenta@cs.ucdavis.edu
Sunghee Choi
Computer Sciences Department
University of Texas at Austin
sunghee@cs.utexas.edu
G¨unter Rote
Institut f¨ur Informatik
Freie Universit¨at Berlin.
rote@inf.fu-berlin.de
ABSTRACT
Randomized incremental constructions are widely used in
computational geometry, but they perform very badly on
large data because of their inherently random memory ac-
cess patterns. We define a biased randomized insertion order
which removes enough randomness to significantly improve
performance, but leaves enough randomness so that the al-

Source: Amenta, Nina - Department of Computer Science, University of California, Davis
O'Brien, James F. - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

Collections: Biology and Medicine; Computer Technologies and Information Sciences