1245 search results - page 41 / 249 » Triangulation for Points on Lines |
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
WADS
1995
Springer
15 years 1 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
ASYNC
2002
IEEE
15 years 2 months ago
2002
IEEE
Reliable, low-latency channel communication between independent clock domains may be achieved using a combination of clock pausing techniques, self-calibrating delay lines and an ...
120
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...