default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Computational Geometry and Applications, Volume 5
Volume 5, Numer 1-2, 1995
- Jean-Daniel Boissonnat, Olivier Devillers
, LeonBattista Donati, Franco P. Preparata:
Motion planning of legged robots: the spider robot problem. 3-20 - Michael B. Dillencourt, Warren D. Smith:
A linear-time algorithm for testing the inscribability of trivalent polyhedra. 21-36 - Naoki Katoh, Kazuo Iwano:
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane. 37-51 - Rolf Klein, Andrzej Lingas:
Manhattonian proximity in a simple polygon. 53-74 - Helmut Alt, Michael Godau:
Computing the Fréchet distance between two polygonal curves. 75-91 - Danny Z. Chen:
An optimal parallel algorithm for detecting weak visibility of a simple polygon. 93-124 - Barun Chandra, Gautam Das, Giri Narasimhan, José Soares:
New sparseness results on graph spanners. 125-144 - John Hershberger:
Optimal parallel algorithms for triangulated simple polygons. 145-170 - Marshall W. Bern, David P. Dobkin, David Eppstein:
Triangulating polygons without large angles. 171-192 - Steven Fortune:
Numerical stability of algorithms for 2-d Delaunay triangulations. 193-213 - Joseph O'Rourke:
Computational geometry column 25. 215-218
Volume 5, Number 3, 1995
- Mark de Berg, Hazel Everett, Hubert Wagener:
Translation queries for sets of polygons. 221-242 - David Rappaport:
Minimum polygon transversals of line segments. 243-256 - Mikhail J. Atallah, Danny Z. Chen:
Computing the all-pairs longest chains in the plane. 257-271 - Hans-Peter Lenhof, Michiel H. M. Smid:
Sequential and parallel algorithms for the k closest pairs problem. 273-288 - Yaw-Ling Lin, Steven Skiena:
Complexity aspects of visibility graphs. 289-312 - Chandrajit L. Bajaj, Andrew V. Royappa:
Finite representations of real parametric curves and surfaces. 313-326 - Hristo N. Djidjev, Andrzej Lingas:
On computing Voronoi diagrams for sorted point sets. 327-337 - Joseph O'Rourke:
Computational geometry column 26. 339-341
Volume 5, Number 4, 1995
- Mark de Berg, Otfried Schwarzkopf:
Cuttings and applications. 343-355 - David Avis, Michael E. Houle:
Computational aspects of Helly's theorem and its relatives. 357-367 - Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri:
Logarithmic-time link path queries in a simple polygon. 369-395 - D. Crass, Ichiro Suzuki, Masafumi Yamashita:
Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem. 397-412 - Anil Kaul, Rida T. Farouki:
Computing Minkowski sums of plane curves. 413-432 - S. H. Kim, Sung Yong Shin, Kyung-Yong Chwa:
Efficient algorithms for solving diagonal visibility problems in a simple polygon. 433-458
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
