Computational Geometry, Volume 23
Volume 23, Number 1, July 2002
Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan: Optimally computing a shortest weakly visible line segment inside a simple polygon. 1-29- Sergei Bespamyatnikh: Packing two disks in a polygon. 31-42
- David Eppstein: Beta-skeletons have unbounded dilation. 43-52
- Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels: Models and motion planning. 53-68
- Joachim Gudmundsson, Mikael Hammar, Marc J. van Kreveld: Higher order Delaunay triangulations. 85-98
Volume 23, Number 2, September 2002
- Siu-Wing Cheng, Kam-Hing Lee: Quadtree, ray shooting and approximate minimum weight Steiner triangulation. 99-116
- Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram: A decomposition-based approach to layered manufacturing. 117-151
- Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia: Optimizing area and aspect ration in straight-line orthogonal tree drawings. 153-162
- Pawel Winter: Optimal Steiner hull algorithm. 163-169
- Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting intersecting pairs of convex polytopes in two and three dimensions. 195-207
- Daniel Freedman: Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited. 227-241
Volume 23, Number 3, November 2002
- Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy: Translating a convex polyhedron over monotone polyhedra. 257-269
- Sergei Bespamyatnikh: An efficient algorithm for enumeration of triangulations. 271-279
- Volker Kaibel, Marc E. Pfetsch: Computing the face lattice of a polytope from its vertex-facet incidences. 281-290
- Prosenjit Bose: On embedding an outer-planar graph in a point set. 303-312
- Jean-Marie Morvan, Boris Thibert: On the approximation of a smooth surface with a triangulated mesh. 337-352
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