22 search results - page 2 / 5 » On the Development of the Intersection of a Plane with a Pol... |
3DPVT
2006
IEEE
13 years 11 months ago
2006
IEEE
Self-calibration is one of the most active issues concerning vision-based 3D measurements. However, in the case of the light sectioning method, there has been little research cond...
GD
2005
Springer
13 years 10 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
SIAMDM
2011
13 years 4 days ago
2011
Consider a closed curve in the plane that does not intersect itself; by the Jordan-Schoenflies Theorem, it bounds a distorted disk. Now consider a closed curve that intersects its...
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
COMPGEOM
2007
ACM
13 years 9 months ago
2007
ACM
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...