default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Computational Geometry and Applications, Volume 3
Volume 3, Number 1, 1993
- Pankaj K. Agarwal, Micha Sharir:
Circular visibility of a simple polygon from a fixed point. 1-25 - James Abello, Ömer Egecioglu:
Visibility graphs of staircase polygons with uniform step length. 27-37 - Ravi Janardan, Mario Alberto López:
Generalized intersection searching problems. 39-69 - Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling two-dimensional composite parts via translations. 71-84 - Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos:
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. 85-105 - Joseph O'Rourke:
Computational geometry column 18. 107-113
Volume 3, Number 2, 1993
- Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen:
Improved selection in totally monotone arrays. 115-132 - Peter Eades, Tao Lin, Xuemin Lin:
Two Tree Drawing Conventions. 133-153 - Fabrizio d'Amore, Paolo Giulio Franciosa:
Separating sets of hyperrectangles. 155-165 - Franco P. Preparata, Jeffrey Scott Vitter:
A Simplified Technique for Hidden-Line Elimination in Terrains. 167-181 - Craig Gotsman, Michael Werman:
Recognition of Affine Transformed Planar Curves by Extremal Geometric Properties. 183-202 - S. Y. Shin:
A predictive algorithm for intersecting parametric polynomial surfaces. 203-219 - Joseph O'Rourke:
Computational geometry column 19. 221-224
Volume 3, Number 3, 1993
- Kwong-fai Chan, Tak Wah Lam:
An on-line algorithm for navigating in unknown environment. 227-244 - Hans-Peter Lenhof, Michiel H. M. Smid:
An optimal construction method for generalized convex layers. 245-267 - Dorothea Wagner:
Optimal routing through dense chanels. 269-289 - D. T. Lee, Majid Sarrafzadeh:
Maximum independent set of a permutation graph in K tracks. 291-304 - Hsuan-Shih Lee, Ruei Chuan Chang:
Regular enumeration of grid points in a convex polygon. 305-322 - Ta. Asano:
Dynamic Programming on Intervals. 323-330 - Ravi Janardan:
On maintaining the width and diameter of a planar point-set online. 331-344 - Joseph O'Rourke:
Computational geometry column 20. 347-349
Volume 3, Number 4, 1993
- Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki:
An incremental algorithm for constructing shortest watchman routes. 351-365 - Ip-Wang Chan, Donald K. Friesen:
Parallel algorithms for some dominance problems based on the PRAM model. 367-382 - Leonidas J. Guibas, John Hershberger, Joseph S. B. Mitchell, Jack Snoeyink:
Approximating Polygons and Subdivisions with Minimum Link Paths. 383-415 - Teofilo F. Gonzalez, Si-Qing Zheng:
An efficient divide and conquer approximation algorithm for partitionning into D-boxes. 417-428 - Olivier Devillers
:
Simultaneous containment of several polygons: analysis of the contact configurations. 429-442 - Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich:
P-complete geometric problems. 443-462 - Joseph O'Rourke:
Computational geometry column 21. 463-465
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-05-25 00:16 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
