default search action
JCDCG 2004: Tokyo, Japan
- Jin Akiyama, Mikio Kano, Xuehou Tan:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3742, Springer 2005, ISBN 3-540-30467-3 - Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
Matching Points with Circles and Squares. 1-15 - Marc Benkert, Alexander Wolff, Florian Widmann:
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. 16-28 - Sergey Bereg:
Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. 29-36 - Sergey Bereg, Adrian Dumitrescu, János Pach:
Sliding Disks in the Plane. 37-47 - Prosenjit Bose, Stefan Langerman:
Weighted Ham-Sandwich Cuts. 48-53 - Hervé Brönnimann:
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. 54-61 - Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff:
Farthest-Point Queries with Geometric and Combinatorial Constraints. 62-75 - Erik D. Demaine, John Iacono, Stefan Langerman:
Grid Vertex-Unfolding Orthostacks. 76-82 - Magdalene Grantson, Christos Levcopoulos:
A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem. 83-94 - Magdalene Grantson, Christos Levcopoulos:
Tight Time Bounds for the Minimum Local Convex Partition Problem. 95-105 - Joachim Gudmundsson, Jan Vahrenhold:
I/O-Efficiently Pruning Dense Spanners. 106-116 - Kiyoshi Hosono, Masatsugu Urabe:
On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons. 117-122 - Hiro Ito:
Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon. 123-130 - Jonathan Lenchner:
Wedges in Euclidean Arrangements. 131-142 - Yoichi Maeda:
Visual Pascal Configuration and Quartic Surface. 143-150 - Jirí Matousek:
Nonexistence of 2-Reptile Simplices. 151-160 - Ileana Streinu, Walter Whiteley:
Single-Vertex Origami and Spherical Expansive Motions. 161-173 - Xuehou Tan:
An Optimal Algorithm for the 1-Searchability of Polygonal Rooms. 174-183 - Gábor Tardos, Géza Tóth:
Crossing Stars in Topological Graphs. 184-197 - Godfried T. Toussaint:
The Geometry of Musical Rhythm. 198-212
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.