COMPGEOM 1990 | Sciweavers

28

click to vote

COMPGEOM
1990
ACM

59views Discrete Geometry» more COMPGEOM 1990»

Linear Programming and Convex Hulls Made Easy

14 years 4 months ago

Download www.eecs.berkeley.edu

Raimund Seidel

claim paper

Read More »

42

click to vote

COMPGEOM
1990
ACM

94views Discrete Geometry» more COMPGEOM 1990»

Minimum-Link Paths Among Obstacles in the Plane

14 years 4 months ago

Download www.inf.fu-berlin.de

Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...

Joseph S. B. Mitchell, Günter Rote, Gerhard J...

claim paper

Read More »

31

click to vote

COMPGEOM
1990
ACM

120views Discrete Geometry» more COMPGEOM 1990»

Finding Compact Coordinate Representations for Polygons and Polyhedra

14 years 4 months ago

Download www.loria.fr

Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...

Victor Milenkovic, Lee R. Nackman

claim paper

Read More »

27

click to vote

COMPGEOM
1990
ACM

71views Discrete Geometry» more COMPGEOM 1990»

On Solving Geometric Optimization Problems Using Shortest Paths

14 years 4 months ago