Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

66

Voted

DAM
2002

favoriteEmaildiscussreport

61views more DAM 2002»

Short trees in polygons

14 years 10 months ago

Short trees in polygons

Download www.diku.dk

Pawel Winter, Martin Zachariasen, Jens Nielsen

Real-time Traffic

DAM 2002 |

claim paper

Related Content

» Watchman tours for polygons with holes

» On Unfolding Lattice PolygonsTrees and Diameter4 Trees

» Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons

» Short and Smooth Polygonal Paths

» An efficient upper bound of the rotation distance of binary trees

» Lower bounds for approximate polygon decomposition and minimum gap

» The polygonal contraction heuristic for rectilinear Steiner tree construction

» RealTime Shadow Generation Using BSP Trees and Stencil Buffers

» Unfolding Convex Polyhedra via Quasigeodesics

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DAM
Authors	Pawel Winter, Martin Zachariasen, Jens Nielsen

Comments (0)