CCCG 1996 | Sciweavers

25

click to vote

CCCG
1996

87views Computational Geometry» more CCCG 1996»

Time-optimal Proximity Graph Computations on Enhanced Meshes

14 years 1 months ago

Download www.csi.uottawa.ca

Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya

claim paper

Read More »

26

click to vote

CCCG
1996

89views Computational Geometry» more CCCG 1996»

Fast Stabbing of Boxes in High Dimensions

14 years 1 months ago

Download www.lix.polytechnique.fr

We present in this paper a simple yet e cient algorithm for stabbing a set S of n axisparallel boxes in d-dimensional space with c(S) points in output-sensitive time O(dn log c(S)...

Frank Nielsen

claim paper

Read More »

28

click to vote

CCCG
1996

78views Computational Geometry» more CCCG 1996»

On Stable Line Segments in Triangulations

14 years 1 months ago

Download www.cse.yorku.ca

Andranik Mirzaian, Cao An Wang, Yin-Feng Xu

claim paper

Read More »

21

click to vote

CCCG
1996

72views Computational Geometry» more CCCG 1996»

O-Convexity Computing Hulls Approximations and Orientation Sets

14 years 1 months ago

Download repository.ust.hk

V. Martynchik, Nikolai N. Metelski, Derick Wood

claim paper

Read More »

37

click to vote

CCCG
1996

141views Computational Geometry» more CCCG 1996»

A Topology Oriented Algorithm for the Voronoi Diagram of Polygons

14 years 1 months ago

Download www.cccg.ca

Toshiyuki Imai

claim paper

Read More »

33

click to vote

CCCG
1996

112views Computational Geometry» more CCCG 1996»

Generalizing Halfspaces

14 years 1 months ago

Download www.cs.cmu.edu

Restricted-orientation convexity is the study of geometric objects whose intersection with lines from some fixed set is empty or connected. We have studied the properties of restri...

Eugene Fink, Derick Wood

claim paper

Read More »

36

click to vote

CCCG
1996

98views Computational Geometry» more CCCG 1996»

Heuristic Motion Planning with Many Degrees of Freedom

14 years 1 months ago

Download www.staff.uni-mainz.de

We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...

Thomas Chadzelek, Jens Eckstein, Elmar Schöme...

claim paper

Read More »

27

click to vote

CCCG
1996

93views Computational Geometry» more CCCG 1996»

Computing Largest Circles Separating Two Sets of Segments

14 years 1 months ago

Download hal.archives-ouvertes.fr

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier D...

claim paper

Read More »

37

click to vote

CCCG
1996

115views Computational Geometry» more CCCG 1996»

Computing the Angularity Tolerance

14 years 1 months ago

Download www.cs.uu.nl

In computational metrology one needs to compute whether an object satis es speci cations of shape within an acceptable tolerance. To this end positions on the object are measured,...

Mark de Berg, Henk Meijer, Mark H. Overmars, Gordo...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers