92 search results - page 12 / 19 » The Number of Triangulations on Planar Point Sets |
244
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
159
click to vote
GD
2007
Springer
16 years 26 days ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
156
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
189
click to vote
CVPR
2011
IEEE
15 years 2 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....
181
Voted
BMVC
1998
15 years 8 months ago
1998
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...