International Journal of Computational Geometry and Applications, Volume 4

Volume 4, Number 1, 1994

• Hossam A. ElGindy, Pinaki Mitra: Orthogonal shortest route queries among axis parallel rectangular obstacles. 3-24
• Vijay Srinivasan, Lee R. Nackman: Maximal balls of linearly separable sets. 25-38
• John Adegeest, Mark H. Overmars, Jack Snoeyink: Minimum-link C-oriented paths: Single-source queries. 39-51
• Majid Sarrafzadeh, D. T. Lee: Restricted track assignment with applications. 53-68
• Naoyoshi Kanamaru, Takao Nishizeki, Tetsuo Asano: Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming. 69-85
• A. James Stewart: Local Robustness and its Application to Polyhedral Intersection. 87-118
• Joseph O'Rourke: Computational geometry column 22. 119-122

Volume 4, Number 2, 1994

• Tetsuo Asano, Leonidas J. Guibas, Takeshi Tokuyama: Walking on an arrangement topologically. 123-151
• Paolo Giulio Franciosa, Carlo Gaibisso, Giorgio Gambosi, Maurizio Talamo: A convex hull algorithm for points with approximately known positions. 153-163
• Karsten Opitz, Helmut Pottmann: Computing shortest paths on polyhedra: applications in geometric modeling and scientific visualization. 165-178
• Kokichi Sugihara, Masao Iri: A robust Topology-Oriented Incremental algorithm for Voronoi diagrams. 179-228
• David Eppstein: Tree-weighted neighbors and geometric k smallest spanning trees. 229-238
• Joseph O'Rourke: Computational geometry column 23. 239-242

Volume 4, Number 3, 1994

• B. Lacolle, Nicolas Szafran, P. Valentin: Geometric Modelling and Algorithms for Binary Mixtures. 243-260
• Luc Devroye, Binhai Zhu: Intersections of random line segments. 261-274
• Pascal Lienhardt: N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds. 275-324
• Susan E. Dorward: A survey of object-space hidden surface removal. 325-362
• Joseph O'Rourke: Computational geometry column 24. 363-366

Volume 4, Number 4, 1994

• Pankaj K. Agarwal, Marc J. van Kreveld: Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. 369-383
• Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis: How to Draw a Series-Parallel Digraph. 385-402
• Alon Efrat, Craig Gotsman: Subpixel image registration using circular fiducials. 403-422
• K. McCroan, R. Lacher: Region coloring, edge coloring, and scan-conversion of maps. 423-455
• Nancy M. Amato: Determining the separation of simple polygons. 457-474
• Reuven Bar-Yehuda, Bernard Chazelle: Triangulating disjoint Jordan chains. 475-481