International Journal of Computational Geometry and Applications, Volume 6

Volume 6, Number 1, 1996

• Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers, Monique Teillaud: Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes. 1-14 BibTeX
• Paul J. Heffernan: An optimal algorithm for the two-guard problem. 15-44 BibTeX
• A. Corbalan, M. L. Mazón, Tomás Recio: Geometry of bisectors for strictly convex distances. 45-58 BibTeX
• W. S. Chan, F. Chin: Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error. 59-77 BibTeX
• Reuven Bar-Yehuda, E. Ben-Hanoch: A linear time algorithm for covering simple polygons with similar rectangles. 79-102 BibTeX
• C. Gitlin, Joseph O'Rourke, V. Subramanian: On reconstructing polyhedra from parallel slices. 103-122 BibTeX
• Joseph O'Rourke: Computational geometry column 27. 123-125 BibTeX

Volume 6, Number 2, 1996

• Jindong Chen, Yijie Han: Shortest paths on a polyhedron. 127-144 BibTeX
• Peter Eades, Xuemin Lin, Roberto Tamassia: An Algorithm for Drawing a Hierarchical Graph. 145-156 BibTeX
• Robert Joan-Arinyo, Alvar Vinacua, Pere Brunet: Classification of a point with respect to a polyhedron vertex. 157-168 BibTeX
• Rex A. Dwyer, William F. Eddy: Maximal empty ellipsoids. 169-186 BibTeX
• A. Chubarev: Robust set operations on polyhedral solids: a fixed precision approach. 187-204 BibTeX
• Sven Schuierer: An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon. 205-226 BibTeX
• B. Guo: On the difficulty of deciding the convexity of polynomials over simplexes. 227-230 BibTeX
• Omer Berkman, Baruch Schieber, Uzi Vishkin: A fast parallel algorithm for finding the convex hull of a sorted point set. 231-242 BibTeX
• Joseph O'Rourke: Computational geometry column 28. 243-244 BibTeX

Volume 6, Number 3, 1996

• Hazel Everett, Jean-Marc Robert, Marc J. van Kreveld: An optimal algorithm for the (<= k)-levels, with applications to separation and transversal problems. 247-261 BibTeX
• Rolf Klein, Andrzej Lingas: A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. 263-278 BibTeX
• Michel Pocchiola, Gert Vegter: The visibility complex. 279-308 BibTeX
• Joseph S. B. Mitchell: Shortest paths among obstacles in the plane. 309-332 BibTeX
• Ashim Garg, Michael T. Goodrich, Roberto Tamassia: Planar upward tree drawings with optimal area. 333-356 BibTeX
• Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng: Approximating center points with iterative Radon points. 357-377 BibTeX
• Frank K. H. A. Dehne, Andreas Fabri, Andrew Rau-Chaplin: Scalable parallel computational geometry for coarse grained multicomputers. 379-400 BibTeX

Volume 6, Number 4, 1996

• Ioannis Fudos, Christoph M. Hoffmann: Correctness proof of a geometric constraint solver. 405-420 BibTeX
• J. Owen: Constraint on simple geometry in two and three dimensions. 421-434 BibTeX
• Pierre J. Malraison: Constraining a quadratic rational Bezier to be an elliptical arc. 435-441 BibTeX
• Malcolm S. Casale: Evaluating geometric sensitivities at singular and non-singular points of variational CAD models for design optimization. 443-460 BibTeX
• Ichiro Suzuki, Masafumi Yamashita: Designing multi-link robot arms in a convex polygon. 461-486 BibTeX
• Olivier Devillers, Andreas Fabri: Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers. 487-506 BibTeX
• Joseph O'Rourke: Computational geometry column 29. 507-511 BibTeX