Sciweavers

256 search results - page 5 / 52
» Short trees in polygons
Sort
View
ISPD
2006
ACM
84views Hardware» more  ISPD 2006»
15 years 7 months ago
Efficient generation of short and fast repeater tree topologies
Christoph Bartoschek, Stephan Held, Dieter Rautenb...
ICALP
1997
Springer
15 years 6 months ago
Constructing Big Trees from Short Sequences
Péter L. Erdös, Mike A. Steel, L&aacut...
SODA
1994
ACM
81views Algorithms» more  SODA 1994»
15 years 3 months ago
Spanning Trees Short or Small
R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel ...
56
Voted
CPC
2002
64views more  CPC 2002»
15 years 1 months ago
Two Short Proofs Concerning Tree-Decompositions
Patrick Bellenbaum, Reinhard Diestel
115
Voted
COMPGEOM
1993
ACM
15 years 5 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas