450 search results - page 18 / 90 » Quadrangulations of Planar Sets |
147
click to vote
CCCG
2007
15 years 7 months ago
2007
We propose a method for computing acute (non-obtuse) triangulations. That is, for a given two dimensional domain (a set of points or a planar straight line graph), we compute a tr...
394
click to vote
IWOCA
2010
Springer
15 years 25 days ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
160
click to vote
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper we present a method to estimate in real-time the position and orientation of a previously viewed planar patch. The algorithm is based on minimising the sum of square...
187
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
165
click to vote
GD
2006
Springer
15 years 9 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...