


default search action
Computational Geometry, Volume 11
Volume 11, Number 1, August 1998
- Matthew Dickerson, Daniel Scharstein:

Optimal placement of convex polygons to maximize point containment. 1-16 - Alex Glozman, Klara Kedem, Gregory Shpitalnik:

On some geometric selection and optimization problems via sorted matrices. 17-28 - Marek Chrobak, Shin-Ichi Nakano:

Minimum-width grid drawings of plane graphs. 29-54
Volume 11, Number 2, October 1998
- Hazel Everett, Ivan Stojmenovic, Pavel Valtr, Sue Whitesides:

The largest k-ball in a d-dimensional box. 59-67 - Mark de Berg, Hazel Everett, Leonidas J. Guibas:

The union of moving polygonal pseudodiscs - Combinatorial bounds and applications. 69-81 - Dan Halperin, Mark H. Overmars:

Spheres, molecules, and hidden surface removal. 83-102 - Michael R. Bussieck, Marco E. Lübbecke

:
The vertex set of a 0/1-polytope is strongly P-enumerable. 103-109 - Iliana Bjorling-Sachs:

Edge guards in rectilinear polygons. 111-123
Volume 11, Number 3-4, December 1998
- Gill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich

:
Offset-polygon annulus placement problems. 125-141 - Michael Segal

, Klara Kedem:
Geometric applications of posets. 143-156 - Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen

:
Dynamic motion planning in low obstacle density environments. 157-173 - John Hershberger, Jack Snoeyink:

Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time. 175-185 - Olivier Devillers

, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia:
Checking the convexity of polytopes and the planarity of subdivisions. 187-208 - Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri:

Label placement by maximum independent set in rectangles. 209-218 - Enrico Puppo:

Variable resolution triangulations. 219-238

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














