Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational 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 - Daniel Richardson, Ahmed El-Sonbaty:
Counterexamples to the uniformity conjecture. 58-64 - 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
- Jianbo Qian, Cao An Wang:
Progress on maximum weight triangulation. 99-105 - 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 - Mark de Berg, Micha Streppel:
Approximate range searching using binary space partitions. 139-151 - 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
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-19 19:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
