104 search results - page 11 / 21 » Intersecting convex sets by rays |
MICCAI
1999
Springer
14 years 1 months ago
1999
Springer
Classical volume rendering is computed by casting a bundle of parallel rays from a flat viewing plane onto the volume data set, and produces as such a spatially limited view of the...
FSTTCS
2007
Springer
14 years 3 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
COMPGEOM
2011
ACM
13 years 1 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
COMPGEOM
1995
ACM
14 years 1 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...