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