default search action
International Journal of Computational Geometry and Applications, Volume 21
Volume 21, Number 1, February 2011
- Maarten Löffler:
Existence and Computation of Tours through Imprecise Points. 1-24 - Prosenjit Bose
, Mercè Mora
On Computing Enclosing Isosceles Triangles and Related Problems. 25-45 - Oswin Aichholzer
Computational and Structural Advantages of Circular Boundary Representation. 47-69 - Muhammad Ashraful Alam, Masud Hasan:
Computing Nice Projections of Convex Polyhedra. 71-85 - Greg Aloupis, Prosenjit Bose
Computing Signed Permutations of Polygons. 87-100 - Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
A Complete Algorithm for Searchlight Scheduling. 101-130
Volume 21, Number 2, April 2011
- John H. Reif, Sam Slee:
Asymptotically Optimal Kinodynamic Motion Planning for a Class of Modular Self-Reconfigurable Robots. 131-155 - Peter Brass
The Aligned k-Center Problem. 157-178 - Otfried Cheong
Reverse Nearest Neighbor Queries in Fixed Dimension. 179-188 - Vladimir Estivill-Castro
Fpt-Algorithms for Minimum-Bends Tours. 189-213 - Therese Biedl, Masud Hasan, Alejandro López-Ortiz:
Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. 215-239 - Matthew J. Katz, Gila Morgenstern:
Guarding Orthogonal Art Galleries with Sliding Cameras. 241-250
Volume 21, Number 3, June 2011
- Seok-Hee Hong, Hiroshi Nagamochi:
Guest Editors' Foreword. 251-252 - Kevin Buchin
Detecting Commuting Patterns by Clustering Subtrajectories. 253-282 - Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
Minkowski Sum Selection and Finding. 283-311 - Sang-Sub Kim, Sang Won Bae
Covering a Point Set by Two Disjoint Rectangles. 313-330 - Zeyu Guo, He Sun, Hong Zhu:
Greedy Construction of 2-Approximate Minimum Manhattan Networks. 331-350 - Ludmila Scharf, Marc Scherfenberg:
Inducing Polygons of Line Arrangements. 351-368 - Christian Knauer, Marc Scherfenberg:
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance. 369-381
Volume 21, Number 4, August 2011
- Therese Biedl, Burkay Genç
Stoker's Theorem for Orthogonal Polyhedra. 383-391 - Luca Castelli Aleardi, Olivier Devillers
Catalog-Based Representation of 2D Triangulations. 393-402 - Guillaume Batog, Xavier Goaoc:
Inflating Balls is NP-Hard. 403-415 - Chansophea Chuon, Sumanta Guha, Paul Janecek, Nguyen Duc Cong Song:
Simplipoly: Curvature-Based Polygonal Curve Simplification. 417-429 - Mustaq Ahmed, Anna Lubiw:
Shortest Descending Paths: towards an Exact Algorithm. 431-466 - Thiago R. dos Santos, Hans-Peter Meinzer, Lena Maier-Hein:
Extending the Doubly Linked Face List for the Representation of 2-pseudomanifolds and 2-Manifolds with Boundaries. 467-494
Volume 21, Number 5, October 2011
- Khaled M. Elbassioni
Finding Simplices containing the Origin in Two and Three Dimensions. 495-506 - Alexander Rand, Noel Walkington
Delaunay Refinement Algorithms for Estimating Local Feature Size in 2D and 3D. 507-543 - A. M. Berkoff, James M. Henle, A. E. McDonough, A. P. Wesolowski:
Possibilities and Impossibilities in Square-Tiling. 545-558 - Guilherme Dias da Fonseca
Fitting Flats to Points with Outliers. 559-569 - Serge Gosselin, Carl Ollivier-Gooch
Constructing Constrained Delaunay Tetrahedralizations of Volumes Bounded by Piecewise Smooth Surfaces. 571-594
Volume 21, Number 6, December 2011
- Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo:
Geodesic Disks and Clustering in a Simple Polygon. 595-608 - Danny Z. Chen, Ewa Misiolek:
Free-Form Surface Partition in 3-d. 609-634 - Wael El Oraiby, Dominique Schmitt, Jean-Claude Spehner:
Centroid Triangulations from k-Sets. 635-659 - Hirofumi Aota, Takuro Fukunaga, Hiroshi Nagamochi:
An Approximation Algorithm for Locating Maximal Disks within Convex Polygons. 661-684 - A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern:
Multi Cover of a Polygon Minimizing the Sum of Areas. 685-698
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 2024-11-04 20:32 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: