62 search results - page 5 / 13 » Triangulations of Line Segment Sets in the Plane |
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
CG
2004
Springer
13 years 7 months ago
2004
Springer
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...
ISVD
2007
IEEE
14 years 1 months ago
2007
IEEE
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...
IPL
2002
13 years 7 months ago
2002
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...