Computational Geometry, Volume 33
Volume 33, Numbers 1-2, January 2006
Chee-Keng Yap, Sylvain Pion: Special Issue on Robust Geometric Algorithms and their Implementations. 1-2- Olivier Devillers, Philippe Guigue: Inner and outer rounding of Boolean operations on lattice polygonal regions. 3-17
- Ioannis Z. Emiris, Menelaos I. Karavelas: The predicates of the Apollonius diagram: Algorithmic analysis and implementation. 18-57
- Elmar Schömer, Nicola Wolpert: An exact and efficient approach for computing a cell in an arrangement of quadrics. 65-97
Volume 33, Number 3, February 2006
- Christopher J. Hillar, Darren L. Rhea: A result about the density of iterated line intersections in the plane. 106-114
- Ovidiu Daescu, Jun Luo, David M. Mount: Proximity problems on line segments spanned by points. 115-129
- Siu-Wing Cheng: On the sizes of Delaunay meshes. 130-138
- 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
- Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer: A linear time algorithm to remove winding of a simple polygon. 165-173
- Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff: Farthest-point queries with geometric and combinatorial constraints. 174-185
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team