Sciweavers

999 search results - page 23 / 200
» Finding shapes in a set of points
Sort
View
LATIN
1998
Springer
15 years 1 months ago
Shape Reconstruction with Delaunay Complex
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
Herbert Edelsbrunner
EPS
1998
Springer
15 years 1 months ago
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
Günter Rudolph
ICASSP
2010
IEEE
14 years 9 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
PAMI
2007
186views more  PAMI 2007»
14 years 9 months ago
The Medial Scaffold of 3D Unorganized Point Clouds
—We introduce the notion of the medial scaffold, a hierarchical organization of the medial axis of a 3D shape in the form of a graph constructed from special medial curves connec...
Frederic F. Leymarie, Benjamin B. Kimia
COMGEO
2006
ACM
14 years 9 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy