default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Computational Geometry and Applications, Volume 11
Volume 11, Number 1, February 2001
- Renato Pajarola
, Peter Widmayer:
Virtual Geoexploration: Concepts and Design Choices. 1-14 - Roberto Tamassia, Luca Vismara:
A Case Study in Algorithm Engineering for Geometric Computing. 15-70 - Kiyoko F. Aoki, D. T. Lee:
Towards Web-Based Computing. 71-104 - Shankar Krishnan, Dinesh Manocha, M. Gopi, Tim Culver, John Keyser:
BOOLE: A Boundary Evaluation System for Boolean Combinations of Sculptured Solids. 105-144
Volume 11, Number 2, April 2001
- Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama:
Efficient Algorithms for Optimization-Based Image Segmentation. 145-166 - Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang:
Labeling a Rectilinear Map with Sliding Labels. 167-179 - Tycho Strijk, Alexander Wolff:
Labeling Points with Circles. 181-195 - Otfried Cheong, René van Oostrum:
Reaching a Polygon with Directional Uncertainty. 197-214 - Vadim Shapiro:
A Convex Deficiency Tree Algorithm for Curved Polygons. 215-238 - Joseph O'Rourke:
Computational Geometry Column 41. 239-242
Volume 11, Number 3, June 2001
- John Hershberger:
Guest Editor's Foreword - Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, Minnesota, June 1998. Int. J. Comput. Geom. Appl. 11(3): 243-244 (2001) - Christoph Burnikel, Stefan Funke, Michael Seel:
Exact Geometric Computation Using Cascading. 245-266 - Marcus Vinícius Alvim Andrade, Jorge Stolfi:
Exact Algorithms for Circles on the Sphere. 267-290 - Timothy M. Chan:
On Enumerating and Selecting Distances. 291-304 - Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. 305-337 - Sunil Arya, Siu-Wing Cheng, David M. Mount:
Approximation Algorithm for Multiple-Tool Milling. 339-372
Volume 11, Number 4, August 2001
- Mikhail J. Atallah, Danny Z. Chen:
On Connecting Red and Blue Rectilinear Polygonal Obstacles with Nonintersecting Monotone Rectilinear Paths. 373-400 - Alejandro López-Ortiz, Sven Schuierer:
Lower Bounds for Streets and Generalized Streets. 401-421 - Thomas Christof, Gerhard Reinelt:
Decomposition and Parallelization Techniques for Enumerating the Facets of Combinatorial Polytopes. 423-437 - J. Rafael Sendra, Carlos Villarino:
Optimal Reparametrization of Polynomial Algebraic Curves. 439-453 - Binhai Zhu, Chung Keung Poon:
Efficient Approximation Algorithms for Two-Label Point Labeling. 455-464 - Gill Barequet, Sariel Har-Peled:
Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. 465-474
Volume 11, Number 5, October 2001
- Jiaye Wang, Ding Yuan Liu, Wenping Wang:
Computing an Almost Minimum Set of Spanning Line Segments of a Polyhedron. 475-485 - Wei Chen, Xiaowen Deng, Koichi Wada, Kimio Kawaguchi:
Constructing a Strongly Convex Superhull of Points. 487-502 - Evanthia Papadopoulou, D. T. Lee:
The Linfty-Voronoi Diagram of Segments and VLSI Applications. 503-528 - Ichiro Suzuki, Yuichi Tazoe, Masafumi Yamashita, Tiko Kameda:
Searching a Polygonal Region from the Boundary. 529-553 - Olivier Devillers, Philippe Guigue:
The Shuffling Buffer. 555-572 - Joseph S. B. Mitchell, Joseph O'Rourke:
Computational Geometry Column 42. 573-582
Volume 11, Number 6, December 2001
- Kurt Mehlhorn, Stefan Meiser, Ronald Rasch:
Furthest Site Abstract Voronoi Diagrams. 583-616 - Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk:
On Geometric Path Query Problems. 617-645 - Sándor P. Fekete, Joseph S. B. Mitchell:
Terrain Decomposition and Layered Manufacturing. 647-668 - Michael Murphy, David M. Mount, Carl W. Gable:
A Point-Placement Strategy for Conforming Delaunay Tetrahedralization. 669-682
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 2026-09-02 01:15 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
