Results 1  10
of
62
Intrinsic subdivision with smooth limits for graphics and animation
 ACM TRANS. GRAPH
, 2006
"... This paper demonstrates the definition of subdivision processes in nonlinear geometries such that smoothness of limits can be proved. We deal with curve subdivision in the presence of obstacles, in surfaces, in Riemannian manifolds, and in the Euclidean motion group. We show how to model kinematic s ..."
Abstract

Cited by 32 (10 self)
 Add to MetaCart
This paper demonstrates the definition of subdivision processes in nonlinear geometries such that smoothness of limits can be proved. We deal with curve subdivision in the presence of obstacles, in surfaces, in Riemannian manifolds, and in the Euclidean motion group. We show how to model kinematic surfaces and motions in the presence of obstacles via subdivision. As to numerics, we consider the sensitivity of the limit’s smoothness to sloppy computing.
Efficient query processing on spatial networks
 In Proceedings of the 13th ACM International Symposium on Advances in Geographic Information Systems
, 2005
"... A framework for determining the shortest path and the distance between every pair of vertices on a spatial network is presented. The framework, termed SILC, uses path coherence between the shortest path and the spatial positions of vertices on the spatial network, thereby, resulting in an encoding t ..."
Abstract

Cited by 23 (12 self)
 Add to MetaCart
A framework for determining the shortest path and the distance between every pair of vertices on a spatial network is presented. The framework, termed SILC, uses path coherence between the shortest path and the spatial positions of vertices on the spatial network, thereby, resulting in an encoding that is compact in representation and fast in path and distance retrievals. Using this framework, a wide variety of spatial queries such as incremental nearest neighbor searches and spatial distance joins can be shown to work on datasets of locations residing on a spatial network of sufficiently large size. The suggested framework is suitable for both main memory and diskresident datasets. Categories and Subject Descriptors
Partial intrinsic reflectional symmetry of 3d shapes
 ACM Transactions on Graphics (TOG
"... Figure 1: Given a closed 2manifold mesh, we compute a scalar field (a), which accentuates the axes of prominent, partial intrinsic reflectional symmetries. The top few (closed) Voronoi boundaries (b) between symmetric point pairs, as induced by the scalar field, can be imperfect. We develop an iter ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
Figure 1: Given a closed 2manifold mesh, we compute a scalar field (a), which accentuates the axes of prominent, partial intrinsic reflectional symmetries. The top few (closed) Voronoi boundaries (b) between symmetric point pairs, as induced by the scalar field, can be imperfect. We develop an iterative refinement scheme to extract the final set of intrinsic reflectional symmetry axes or IRSAs (c), which can be open curves. Incorporating symmetry cues offered by IRSAs into a conventional mesh segmentation scheme leads to highly semantic results (d). While many 3D objects exhibit various forms of global symmetries, prominent intrinsic symmetries which exist only on parts of an object are also well recognized. Such partial symmetries are often seen as more natural than a global one, even when the symmetric parts are under complex pose. We introduce an algorithm to extract partial intrinsic reflectional symmetries (PIRS) of a 3D shape. Given a closed 2manifold mesh, we develop a voting scheme to obtain an intrinsic reflectional symmetry axis (IRSA) transform, which is a scalar field over the mesh that accentuates prominent IRSAs of the shape. We then extract a set of explicit IRSA curves on the shape based on a refined measure of local reflectional symmetry support along a curve. The iterative refinement procedure combines IRSAinduced region growing and regionconstrained symmetry support refinement to improve accuracy and address potential issues arising from rotational symmetries in the shape. We show how the extracted IRSA curves can be incorporated into a conventional mesh segmentation scheme so that the implied symmetry cues can be utilized to obtain more meaningful results. We also demonstrate the use of IRSA curves for symmetrydriven part repair. 1
Interactive decal compositing with discrete exponential maps
 ACM Trans. Graph
, 2006
"... Figure 1: A clay elephant statue (left) was modeled using sketchbased implicitsurface modeling software. Then, a lapped base texture and 25 feature textures were extracted from 22 images taken with a digital camera and composited on the surface. Photography, image creation, and texture positioning ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
Figure 1: A clay elephant statue (left) was modeled using sketchbased implicitsurface modeling software. Then, a lapped base texture and 25 feature textures were extracted from 22 images taken with a digital camera and composited on the surface. Photography, image creation, and texture positioning was completed in under an hour. A method is described for texturing surfaces using decals, images placed on the surface using local parameterizations. Decal parameterizations are generated with a novel O(N logN) discrete approximation to the exponential map which requires only a single additional step in Dijkstra’s graphdistance algorithm. Decals are dynamically composited in an interface that addresses many limitations of previous work. Tools for image processing, deformation/featurematching, and vector graphics are implemented using direct surface interaction. Exponential map decals can contain holes and can also be combined with conformal parameterization to reduce distortion. The exponential map approximation can be computed on any point set, including meshes and sampled implicit surfaces, and is relatively stable under resampling. The decals stick to the surface as it is interactively deformed, allowing the texture to be preserved even if the surface changes topology. These properties make exponential map decals a suitable approach for texturing animated implicit surfaces.
Fast mesh segmentation using random walks
 In ACM Symposium on Solid and Physical Modeling
, 2008
"... 3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an important step towards model understanding, and acts as a useful tool for different mesh processing applications, e.g. revers ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an important step towards model understanding, and acts as a useful tool for different mesh processing applications, e.g. reverse engineering and modeling by example. We extend a random walk method used previously for image segmentation to give algorithms for both interactive and automatic mesh segmentation. This method is extremely efficient, and scales almost linearly with increasing number of faces. For models of moderate size, interactive performance is achieved with commodity PCs. It is easytoimplement, robust to noise in the mesh, and yields results suitable for downstream applications for both graphical and engineering models.
Metric combinatorics of convex polyhedra: Cut loci and nonoverlapping unfoldings
, 2003
"... Abstract. Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfolding into R d, so the metric space S is obtained from a closed (usually nonconvex) polyhedral ball in R d by id ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
Abstract. Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfolding into R d, so the metric space S is obtained from a closed (usually nonconvex) polyhedral ball in R d by identifying pairs of boundary faces isometrically. Our existence proof exploits geodesic flow away from a source point v ∈ S, which is the exponential map to S from the tangent space at v. We characterize the cut locus (the closure of the set of points in S with more than one shortest path to v) as a polyhedral complex in terms of Voronoi diagrams on facets. Analyzing infinitesimal expansion of the wavefront consisting of points at constant distance from v on S produces an algorithmic method for constructing Voronoi diagrams in each facet, and hence the unfolding of S. The algorithm, for which we provide pseudocode, solves the discrete geodesic problem. Its main construction generalizes the source unfolding for boundaries of 3polytopes into R 2. We present conjectures concerning the number of shortest paths on the boundaries of convex polyhedra, and concerning continuous unfolding of convex polyhedra. We also comment on the intrinsic nonpolynomial complexity of nonconvex manifolds.
SpectralDriven IsometryInvariant Matching of 3D Shapes
, 2009
"... This paper presents a matching method for 3D shapes, which comprises a new technique for surface sampling and two algorithms for matching 3D shapes based on pointbased statistical shape descriptors. Our sampling technique is based on critical points of the eigenfunctions related to the smaller eige ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
This paper presents a matching method for 3D shapes, which comprises a new technique for surface sampling and two algorithms for matching 3D shapes based on pointbased statistical shape descriptors. Our sampling technique is based on critical points of the eigenfunctions related to the smaller eigenvalues of the LaplaceBeltrami operator. These critical points are invariant to isometries and are used as anchor points of a sampling technique, which extends the farthest point sampling by using statistical criteria for controlling the density and number of reference points. Once a set of reference points has been computed, for each of them we construct a pointbased statistical descriptor (PSSD, for short) of the input surface. This descriptor incorporates an approximation of the geodesic shape distribution and other geometric information describing the surface at that point. Then, the dissimilarity between two surfaces is computed by comparing the corresponding sets of PSSDs with bipartite graph matching or measuring the L1distance between the reordered feature vectors of a proximity graph. Here, the reordering is given by the Fiedler vector of a Laplacian matrix
Rapid and Effective Segmentation of 3D Models using Random Walks
"... 3D models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Model segmentation is an important step towards model understanding, and acts as a useful tool for different model processing applications, e.g. reverse e ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
3D models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Model segmentation is an important step towards model understanding, and acts as a useful tool for different model processing applications, e.g. reverse engineering and modeling by example. We extend a random walk method used previously for image segmentation to give algorithms for both interactive and automatic model segmentation. This method is extremely efficient, and scales almost linearly with the number of faces, and the number of regions. For models of moderate size, interactive performance is achieved with commodity PCs. We demonstrate that this method can be applied to both triangle meshes and point cloud data. It is easytoimplement, robust to noise in the model, and yields results suitable for downstream applications for both graphical and engineering models. Key words: model segmentation, random walks, interactive