8 search results - page 2 / 2 » Largest Subsets of Triangles in a Triangulation |
IMR
2004
Springer
13 years 10 months ago
2004
Springer
This paper presents a technique for the adaptive refinement of tetrahedral meshes. What makes it unique is that no neighbor information is required for the refined mesh to be co...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
We present a framework for computing optimal transformations, aligning one point set to another, in the presence of outliers. Example applications include shape matching and regis...
DM
2002
13 years 5 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...