Discrete and Computational Geometry - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

35

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540423065, 9783540477389

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficient algorithms for the minimum diameter bridge problem

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_34 ◽

2001 ◽

pp. 362-369 ◽

Author(s):

Takeshi Tokuyama

Keyword(s):

Efficient Algorithms ◽

Minimum Diameter ◽

Download Full-text

Triangle Contact Systems, Orthogonal Plane Partitions, and their Hit Graphs

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_25 ◽

2001 ◽

pp. 264-273

Author(s):

Atsuhiro Nakamoto

Keyword(s):

Plane Partitions ◽

Orthogonal Plane

Download Full-text

Tight Error Bound of Goemetric Problems on Convex Objects with Imprecise Coordinates

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_24 ◽

2001 ◽

pp. 252-263 ◽

Author(s):

Takayuki Nagai ◽

Nobuki Tokura

Keyword(s):

Download Full-text

On Paths in a Complete Bipartite Geometric Graph

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_17 ◽

2001 ◽

pp. 187-191 ◽

Author(s):

Atsushi Kaneko ◽

M. Kano

Keyword(s):

Geometric Graph

Download Full-text

Generalized Balanced Partitions of Two Sets of Points in the Plane

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_16 ◽

2001 ◽

pp. 176-186 ◽

Author(s):

Atsushi Kaneko ◽

M. Kano

Download Full-text

Sum of Edge Lengths of a Graph Drawn on a Convex Polygon

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_14 ◽

2001 ◽

pp. 160-166 ◽

Author(s):

Hiro Ito ◽

Hideyuki Uehara ◽

Mitsuo Yokoyama

Keyword(s):

Download Full-text

Volume Queries in Polyhedra

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_13 ◽

2001 ◽

pp. 156-159 ◽

Author(s):

John Iacono ◽

Stefan Langerman

Download Full-text

On the complexity of the union of geometric objects

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_28 ◽

2001 ◽

pp. 292-307 ◽

Author(s):

János Pach

Keyword(s):

Geometric Objects

Download Full-text

On the Skeleton of the Metric Polytope

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_10 ◽

2001 ◽

pp. 125-136 ◽

Author(s):

Antoine Deza ◽

Komei Fukuda ◽

Dmitrii Pasechnik ◽

Masanori Sato

Download Full-text

Problems and Results around the Erdös-Szekeres Convex Polygon Theorem

Discrete and Computational Geometry - Lecture Notes in Computer Science ◽

10.1007/3-540-47738-1_7 ◽

2001 ◽

pp. 91-105 ◽

Author(s):

Imre Bárány ◽

Gyula Károlyi

Keyword(s):

Download Full-text