52 search results - page 4 / 11 » Triangulations Intersect Nicely |
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
IV
2009
IEEE
14 years 1 months ago
2009
IEEE
Many data sets are visualized effectively with area proportional Venn diagrams, where the area of the regions is in proportion to a defined specification. In particular, Venn diag...
UAI
2003
13 years 8 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...