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