Sciweavers

279 search results - page 9 / 56
» Implicit Convex Polygons
Sort
View
TVCG
2002
109views more  TVCG 2002»
13 years 7 months ago
Robust Creation of Implicit Surfaces from Polygonal Meshes
Implicit surfaces are used for a number of tasks in computer graphics, including modeling soft or organic objects, morphing, collision detection, and constructive solid geometry. A...
Gary D. Yngve, Greg Turk
CORR
2010
Springer
113views Education» more  CORR 2010»
13 years 7 months ago
Opaque sets
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opa...
Adrian Dumitrescu, János Pach
JC
2007
57views more  JC 2007»
13 years 7 months ago
Discrepancy with respect to convex polygons
We study the problem of discrepancy of finite point sets in the unit square with respect to convex polygons, when the directions of the edges are fixed, when the number of edges ...
W. W. L. Chen, G. Travaglini
CORR
2007
Springer
100views Education» more  CORR 2007»
13 years 7 months ago
Unfolding Convex Polyhedra via Quasigeodesics
We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds th...
Jin-ichi Itoh, Joseph O'Rourke, Costin Vîlcu
COMPGEOM
2004
ACM
14 years 1 months ago
On distinct distances from a vertex of a convex polygon
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
Adrian Dumitrescu