Sciweavers

9 search results - page 1 / 2
» Polygon decomposition based on the straight line skeleton
Sort
View
COMPGEOM
2003
ACM
13 years 9 months ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
Mirela Tanase, Remco C. Veltkamp
GEOINFORMATICA
2008
144views more  GEOINFORMATICA 2008»
13 years 4 months ago
Area Collapse and Road Centerlines based on Straight Skeletons
Skeletonization of polygons is a technique, which is often applied to problems of cartography and geographic information science. Especially it is needed for generalization tasks ...
Jan-Henrik Haunert, Monika Sester
CVGIP
2004
169views more  CVGIP 2004»
13 years 4 months ago
Contour interpolation by straight skeletons
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) ...
Gill Barequet, Michael T. Goodrich, Aya Levi-Stein...
ICIAP
2007
ACM
13 years 8 months ago
Parsing Silhouettes without Boundary Curvature
We describe a new decomposition algorithm for twodimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by group...
Ralf Juengling, Lakshman Prasad
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 4 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...