Skip to main content
Open Access Publications from the University of California

Blocked Randomized Incremental Constructions


Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns. We define an insertion order which removes enough randomness to significantly improve performance, but leaves enough randomness so that the algorithms remain theoretically optimal.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View