Sciweavers

4761 search results - page 214 / 953
» Generalizing Boundary Points
Sort
View
120
Voted
IJRR
2008
107views more  IJRR 2008»
15 years 4 months ago
Caging Polygons with Two and Three Fingers
: We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible...
Mostafa Vahedi, A. Frank van der Stappen
PR
2007
184views more  PR 2007»
15 years 3 months ago
Shape retrieval using triangle-area representation and dynamic space warping
We present a shape representation and a matching method for nonrigid shapes with closed contours. The representation utilizes the areas of the triangles formed by the boundary poi...
Naif Alajlan, Ibrahim El Rube, Mohamed S. Kamel, G...
SIGGRAPH
1997
ACM
15 years 8 months ago
Guaranteeing the topology of an implicit surface polygonization for interactive modeling
Morse theory shows how the topology of an implicit surface is affected by its function’s critical points, whereas catastrophe theory shows how these critical points behave as th...
Barton T. Stander, John C. Hart
CCCG
2009
15 years 5 months ago
On Directed Graphs with an Upward Straight-line
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
SIAMDM
2008
90views more  SIAMDM 2008»
15 years 3 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen