default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternational Journal of Computational Geometry and Applications, Volume 23
Volume 23, Number 1, February 2013
- Victor Milenkovic, Elisha Sacks, Steven Trac:
Planar Shape Manipulation using Approximate Geometric Primitives. 1-28 - Mark de Berg, Dirk H. P. Gerrits:
Computing Push Plans for Disk-shaped Robots. 29-48 - Steve Butler, Erik D. Demaine, Ronald L. Graham, Tomohiro Tachi
:
Constructing Points through Folding and Intersection. 49-64 - Toshihiro Shirakawa, Ryuhei Uehara:
Common Developments of Three Incongruent Orthogonal Boxes. 65-
Volume 23, Number 2, April 2013
- Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto:
Guest Editors' Foreword. 73-74 - Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, Isaac Shapiro-Ellowitz:
Folding Equilateral Plane graphs. 75-92 - Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati:
Simultaneous Embedding of Embedded Planar graphs. 93-126 - Adrian Dumitrescu, Masud Hasan:
Cutting out Polygons with a Circular SAW. 127-140 - Yakov Nekrich:
External Memory orthogonal Range Reporting with Fast Updates. 141-
Volume 23, Number 3, June 2013
- Otfried Cheong, Changryeol Lee:
Single-Source Dilation-Bounded Minimum Spanning Trees. 159-170 - Peter Alexander Grossman, Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas:
Minimal Curvature-Constrained Paths in the Plane with a Constraint on arcs with Opposite orientations. 171-196 - Tirasan Khandhawit, Dimitrios Pagonakis, Sira Sriswasdi:
Lower Bound for Convex Hull Area and Universal Cover Problems. 197-212 - Ferran Hurtado, Giuseppe Liotta, David R. Wood:
Proximity Drawings of High-Degree Trees. 213-
Volume 23, Numbers 4-5, August & October 2013
- Gill Barequet:
Editor's Foreword. 231-232 - Peyman Afshani:
Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems. 233-252 - Amirali Abdullah, John Moeller, Suresh Venkatasubramanian:
Approximate Bregman Near Neighbors in Sublinear Time: beyond the Triangle inequality. 253-302 - Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh:
The stability of Delaunay Triangulations. 303-334 - Haim Kaplan, Micha Sharir:
Finding the largest Empty Disk containing a Query Point. 335-356 - Therese Biedl, Martin Vatshelle:
The Point-Set Embeddability Problem for Plane graphs. 357-396 - Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis, Luis Mariano Peñaranda:
An Oracle-Based, output-Sensitive Algorithm for Projections of Resultant Polytopes. 397-424
Volume 23, Number 6, December 2013
- Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee:
Guest Editors' Foreword. 425-426 - Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala:
Robust nonparametric Simplification of Polygonal Chains. 427-442 - Evanthia Papadopoulou, Sandeep Kumar Dey:
On the Farthest Line-Segment Voronoi Diagram. 443-460
- Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy:
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. 461-
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 2025-10-22 02: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:
