Computational Geometry, Volume 33

Volume 33, Numbers 1-2, January 2006

Robust Geometric Applications and their Implementations

Chee-Keng Yap, Sylvain Pion:
Special Issue on Robust Geometric Algorithms and their Implementations. 1-2
Electronic Edition (link) BibTeX
Olivier Devillers, Philippe Guigue:
Inner and outer rounding of Boolean operations on lattice polygonal regions. 3-17
Electronic Edition (link) BibTeX
Ioannis Z. Emiris, Menelaos I. Karavelas:
The predicates of the Apollonius diagram: Algorithmic analysis and implementation. 18-57
Electronic Edition (link) BibTeX
Daniel Richardson, Ahmed El-Sonbaty:
Counterexamples to the uniformity conjecture. 58-64
Electronic Edition (link) BibTeX
Elmar Schömer, Nicola Wolpert:
An exact and efficient approach for computing a cell in an arrangement of quadrics. 65-97
Electronic Edition (link) BibTeX

Jianbo Qian, Cao An Wang:
Progress on maximum weight triangulation. 99-105
Electronic Edition (link) BibTeX
Christopher J. Hillar, Darren L. Rhea:
A result about the density of iterated line intersections in the plane. 106-114
Electronic Edition (link) BibTeX
Ovidiu Daescu, Jun Luo, David M. Mount:
Proximity problems on line segments spanned by points. 115-129
Electronic Edition (link) BibTeX
Siu-Wing Cheng:
On the sizes of Delaunay meshes. 130-138
Electronic Edition (link) BibTeX
Mark de Berg, Micha Streppel:
Approximate range searching using binary space partitions. 139-151
Electronic Edition (link) BibTeX
Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron:
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. 152-164
Electronic Edition (link) BibTeX
Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer:
A linear time algorithm to remove winding of a simple polygon. 165-173
Electronic Edition (link) BibTeX
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff:
Farthest-point queries with geometric and combinatorial constraints. 174-185
Electronic Edition (link) BibTeX