Sciweavers

281 search results - page 41 / 57
» Computing Subdivision Surface Intersection
Sort
View
SCALESPACE
2009
Springer
15 years 2 months ago
From a Single Point to a Surface Patch by Growing Minimal Paths
Abstract. We introduce a novel implicit approach for surface patch segmentation in 3D images starting from a single point. Since the boundary surface of an object is locally homeom...
Fethallah Benmansour, Laurent D. Cohen
PAMI
2006
225views more  PAMI 2006»
14 years 9 months ago
Robust Structure and Motion from Outlines of Smooth Curved Surfaces
: This article addresses the problem of estimating the motion of a camera as it observes the outline (or apparent contour) of a solid bounded by a smooth surface in successive imag...
Yasutaka Furukawa, Amit Sethi, Jean Ponce, David J...
COMPGEOM
2006
ACM
15 years 3 months ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir
TOG
2002
130views more  TOG 2002»
14 years 9 months ago
Dual contouring of hermite data
This paper describes a new method for contouring a signed grid whose edges are tagged by Hermite data (i.e; exact intersection points and normals). This method avoids the need to ...
Tao Ju, Frank Losasso, Scott Schaefer, Joe D. Warr...
CGF
2010
132views more  CGF 2010»
14 years 10 months ago
Hybrid Booleans
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
Darko Pavic, Marcel Campen, Leif Kobbelt