Sciweavers

39 search results - page 6 / 8
» Distinct Triangle Areas in a Planar Point Set
Sort
View
ACIVS
2009
Springer
14 years 2 months ago
Evaluation of Interest Point Detectors for Non-planar, Transparent Scenes
The detection of stable, distinctive and rich feature point sets has been an active area of research in the field of video and image analysis. Transparency imaging, such as X-ray,...
Chrysi Papalazarou, Peter M. J. Rongen, Peter H. N...
SIGACT
2008
103views more  SIGACT 2008»
13 years 7 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
COMGEO
2012
ACM
12 years 3 months ago
Point-set embeddings of plane 3-trees
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur...
PCM
2004
Springer
105views Multimedia» more  PCM 2004»
14 years 1 months ago
Image Registration Using Triangular Mesh
Image registration is a fundamental problem in the area of computer vision and has been extensively researched. Different image registration algorithm has its pros and cons. Unlik...
Ben Yip, Jesse S. Jin
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 8 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic