Sciweavers

102291 search results - page 308 / 20459
» Computability in Computational Geometry
Sort
View
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Exact and Robust (Self-)Intersections for Polygonal Meshes
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
Marcel Campen and Leif Kobbelt
183
Voted
VISUALIZATION
2002
IEEE
15 years 11 months ago
Fast Visualization of Plane-Like Structures in Voxel Data
We present a robust, noise-resistant criterion characterizing planelike skeletons in binary voxel objects. It is based on a distance map and the geodesic distance along the object...
Steffen Prohaska, Hans-Christian Hege
COMPGEOM
2010
ACM
15 years 11 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
ICCTA
2007
IEEE
16 years 1 months ago
Covering a Set of Points in a Plane Using Two Parallel Rectangles
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Chandan Saha, Sandip Das
VIS
2004
IEEE
114views Visualization» more  VIS 2004»
16 years 7 months ago
Modeling Decomposing Objects under Combustion
We present a simple yet effective method for modeling of object decomposition under combustion. A separate simulation models the flame production and generates heat from a combust...
John Keyser, Zeki Melek
« Prev « First page 308 / 20459 Last » Next »