default search action
3. JCDCG 2000: Tokyo, Japan
- Jin Akiyama, Mikio Kano, Masatsugu Urabe:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers. Lecture Notes in Computer Science 2098, Springer 2001, ISBN 3-540-42306-0 - Jin Akiyama, Gisaku Nakamura:
Dudeney Dissections of Polygons and Polyhedrons - A Survey. 1-30 - Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura:
Universal Measuring Devices without Gradations. 31-40 - Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa:
A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square. 41-52 - Jin Akiyama, Toshinori Sakai, Jorge Urrutia:
Sequentially Divisible Dissections of Simple Polygons. 53-66 - Helmut Alt, Ferran Hurtado:
Packing Convex Polygons into Rectangular Boxes. 67-80 - Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer:
On the Number of Views of Polyhedral Scenes. 81-90 - Imre Bárány, Gyula Károlyi:
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem. 91-105 - Peter Braß:
On Finding Maximum-Cardinality Symmetric Subsets. 106-112 - Erik D. Demaine:
Folding and Unfolding Linkages, Paper, and Polyhedra. 113-124 - Antoine Deza, Komei Fukuda, Dmitrii V. Pasechnik
, Masanori Sato:
On the Skeleton of the Metric Polytope. 125-136 - Greg N. Frederickson:
Geometric Dissections that Swing and Twist. 137-148 - Kiyoshi Hosono, David Rappaport, Masatsugu Urabe:
On Convex Decompositions of Points. 149-155 - John Iacono, Stefan Langerman:
Volume Queries in Polyhedra. 156-159 - Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
Sum of Edge Lengths of a Graph Drawn on a Convex Polygon. 160-166 - Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya:
On Double Bound Graphs with Respect to Graph Operations. 167-175 - Atsushi Kaneko, Mikio Kano:
Generalized Balanced Partitions of Two Sets of Points in the Plane. 176-186 - Atsushi Kaneko, Mikio Kano:
On Paths in a Complete Bipartite Geometric Graph. 187-191 - Naoki Katoh, Hiromichi Kojima, Ryo Taniguchi:
Approximating Uniform Triangular Meshes for Spheres. 192-204 - Pierre Kauffmann, Jean-Claude Spehner:
The Construction of Delaunay Diagrams by Lob Reduction. 205-216 - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe:
Geometric Transformations in Plane Triangulations. 217-221 - David G. Kirkpatrick, Bettina Speckmann:
Separation Sensitive Kinetic Separation Structures for Convex Polygons. 222-236 - Hiroshi Maehara:
On Acute Triangulations of Quadrilaterals. 237-243 - Andrea Mantler, Jack Snoeyink:
Intersecting Red and Blue Line Segments in Optimal Time and Precision. 244-251 - Takayuki Nagai, Nobuki Tokura:
Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates. 252-263 - Atsuhiro Nakamoto:
Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs. 264-273 - Atsuhiro Nakamoto, Seiya Negami:
Note on Diagonal Flips and Chromatic Numbers of Quadrangulations on Closed Surfaces. 274-279 - Joseph O'Rourke:
An Extension of Cauchy's Arm Lemma with Application to Curve Development. 280-291 - János Pach:
On the Complexity of the Union of Geometric Objects. 292-307 - János Pach, József Solymosi:
Structure Theorems for Systems of Segments. 308-317 - András Recski, Dávid Szeszlér:
3-Dimensional Single Active Layer Routing. 318-329 - Fumihiko Takeuchi:
Nonregular Triangulations, View Graphs of Triangulations, and Linear Programming Duality. 330-338 - Xuehou Tan:
Efficient Algorithms for Searching a Polygonal Room with a Door. 339-350 - Yoshinori Teshima, Yoshinori Watanabe, Tohru Ogawa:
A New Structure of Cylinder Packing. 351-361 - Takeshi Tokuyama
Efficient Algorithms for the Minimum Diameter Bridge Problem. 362-369 - Csaba D. Tóth:
Illuminating Both Sides of Line Segments. 370-380
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-01-27 20:51 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: