CCCG 1993 | Sciweavers

37

CCCG
1993

81views Computational Geometry» more CCCG 1993»

Shortest Paths for a Two-robot Rendez-vous

14 years 1 months ago

In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...

Erik L. Wynters, Joseph S. B. Mitchell

claim paper

Read More »

37

click to vote

CCCG
1993

190views Computational Geometry» more CCCG 1993»

Algorithms for Ham Sandwich Cuts

14 years 1 months ago

Download edocs.fu-berlin.de

Given disjoint sets P1 P2 : : : Pd in R d with n points in total, a ham-sandwich cut is a hyperplane that simultaneously bisects the Pi. We present algorithms for nding

William L. Steiger

claim paper

Read More »

36

click to vote

CCCG
1993

101views Computational Geometry» more CCCG 1993»

Maintaining the Approximate Width of a Set of Points in the Plane

14 years 1 months ago

Download www.inf.fu-berlin.de

d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...

Günter Rote, Christian Schwarz, Jack Snoeyink

claim paper

Read More »

40

click to vote

CCCG
1993

75views Computational Geometry» more CCCG 1993»

Folding Rulers inside Triangles

14 years 1 months ago

Download cgm.cs.mcgill.ca

An l-ruler is a chain of n links, each of length l. The links, which are allowed to cross, are modeled by line segments whose endpoints act as joints. A given conﬁguration of an ...

Marc J. van Kreveld, Jack Snoeyink, Sue Whitesides

claim paper

Read More »

28

click to vote

CCCG
1993

96views Computational Geometry» more CCCG 1993»

Optimal Slope Selection Via Expanders

14 years 1 months ago

Download www.cs.duke.edu

Matthew J. Katz, Micha Sharir

claim paper

Read More »

32

click to vote

CCCG
1993

148views Computational Geometry» more CCCG 1993»

Widest-corridor Problems

14 years 1 months ago

Download www.cs.helsinki.fi

A k-dense corridor through a ﬁnite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...

Ravi Janardan, Franco P. Preparata

claim paper

Read More »

35

click to vote

CCCG
1993

116views Computational Geometry» more CCCG 1993»

Algorithms for Proximity Problems on Colored Point Sets

14 years 1 months ago

Download www.geometrylab.de

Klaus Hinrichs, Thorsten Graf

claim paper

Read More »

36

click to vote

CCCG
1993

81views Computational Geometry» more CCCG 1993»

On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions

14 years 1 months ago

Download acg.cs.tau.ac.il

Leonidas J. Guibas, Dan Halperin, Jirí Mato...

claim paper

Read More »

32

click to vote

CCCG
1993

66views Computational Geometry» more CCCG 1993»

Simple Randomized Algorithms for Closest Pair Problems

14 years 1 months ago

Download people.scs.carleton.ca

Mordecai J. Golin, Rajeev Raman, Christian Schwarz...

claim paper

Read More »

39

click to vote

CCCG
1993

141views Computational Geometry» more CCCG 1993»

The Floodlight Problem

14 years 1 months ago

Download igitur-archive.library.uu.nl

Given three angles summing to 2, given n points in the plane and a tripartition k1 + k2 + k3 = n, we can tripartition the plane into three wedges of the given angles so that the ...

Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Ma...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers