Volume 4,
1994
- Teofilo F. Gonzalez, Mohammadreza Razzazi, Man-tak Shing, Si-Qing Zheng:
On Optimal Guillotine Partitions Approximating Optimal D-box Partitions.
1-11
- J. Mark Keil:
Computing a Subgraph of the Minimum Weight Triangulation.
18-26
- Jean-Marc Robert, Godfried T. Toussaint:
Linear Approximation of Simple Objects.
27-52
- Bernard Chazelle, Joel Friedman:
Point Location Among Hyperplanes and Unidirectional Ray-shooting.
53-62
- John Hershberger, Jack Snoeyink:
Computing Minimum Length Paths of a Given Homotopy Class.
63-97
- Micha Sharir, Sivan Toledo:
External Polygon Containment Problems.
99-118
- Alon Efrat, Micha Sharir, Alon Ziv:
Computing the Smallest K-enclosing Circle and Related Problems.
119-136
- Paul J. Heffernan, Stefan Schirra:
Approximate Decision Algorithms for Point Set Congruence.
137-156
- Kathleen Romanik, Carl Smith:
Testing Geometric Objects.
157-176
- Pankaj K. Agarwal:
On Stabbling Lines for Convex Polyhedra in 3D.
177-189
- Komei Fukuda, Vera Rosta:
Combinatorial Face Enumeration in Convex Polytopes.
191-198
- Andrzej Lingas:
A Linear-time Construction of the Relative Neighborhood Graph From the Delaunay Triangulation.
199-208
- Joseph O'Rourke, Jennifer Rippel:
Two Segment Classes with Hamiltonian Visibility Graphs.
209-218
- David Rappaport, Arnold Rosenbloom:
Moldable and Castable Polygons.
219-233
- Giuseppe Di Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis:
Algorithms for Drawing Graphs: an Annotated Bibliography.
235-282
- Jerzy W. Jaromczyk, Grzegorz W. Wasilkowski:
Computing Convex Hull in a Floating Point Arithmetic.
283-292
- Tomio Hirata, Jirí Matousek, Xuehou Tan, Takeshi Tokuyama:
Complexity of Projected Images of Convex Subdivisions.
293-308
- Evangelos Kranakis, Michel Pocchiola:
Counting Problems Relating to a Theorem of Dirichlet.
309-325
- Werner Schindler:
Equivariant Mappings: a New Approach in Stochastic Simulations.
327-343
Copyright © Sat Nov 14 05:47:20 2009
by Michael Ley (ley@uni-trier.de)
