External Links

    Journal: Int. J. Comput. Geometry Appl.

    Volume 4, Issue 4

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

    Volume 4, Issue 3

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

    Volume 4, Issue 2

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

    Volume 4, Issue 1

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