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
- L. Jackson, Stephen K. Wismath:
Orthogonal polygon reconstruction from stabbing information.
69-83
- 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
- José Cáceres, Alberto Márquez:
An aperiodic tiles machine.
171-182
- Hyeon-Suk Na, Chung-Nim Lee, Otfried Cheong:
Voronoi diagrams on the spher.
183-194
- 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
- Dan Halperin, Eli Packer:
Iterated snap rounding.
209-225
- Daniel Freedman:
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited.
227-241
- Thomas Erlebach, Jirí Fiala:
On-line coloring of geometric intersection graphs.
243-255
Volume 23,
Number 3,
November 2002
Copyright © Tue Dec 1 16:29:40 2009
by Michael Ley (ley@uni-trier.de)
