Results 1  10
of
1,458
Parameterization for fitting triangular mesh ∗
"... Abstract In recent years, with the development of 3D data acquisition equipments, the study on reverse engineering becomes more and more important. However, the existing methods for parameterization are hard to ensure that the parametric domain is rectangular, and the parametric curve grid is regula ..."
Abstract
 Add to MetaCart
is regular. In order to overcome the limitations, we present a novel method for parameterization of triangular mesh in this paper. The basic idea is twofold: first, because the isotherms in the steady temperature do not intersect with each other, and distribute uniformly, it guarantees
Estimating curvature on triangular meshes
 International Journal of Shape Modeling
, 2006
"... This paper takes a systematic look at methods for estimating the curvature of surfaces represented by triangular meshes. We have developed a suite of test cases for assessing the sensitivity of curvature calculations to noise, mesh resolution, and mesh regularity. These tests are applied to existing ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
This paper takes a systematic look at methods for estimating the curvature of surfaces represented by triangular meshes. We have developed a suite of test cases for assessing the sensitivity of curvature calculations to noise, mesh resolution, and mesh regularity. These tests are applied
Isometric Morphing of Triangular Meshes
 CCCG
, 2008
"... We present a novel approach to morph between two isometric poses of the same nonrigid object given as triangular meshes. We model the morphs as linear interpolations in a suitable shape space S. For triangulated 3D polygons, we prove that interpolating linearly in this shape space corresponds to th ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We present a novel approach to morph between two isometric poses of the same nonrigid object given as triangular meshes. We model the morphs as linear interpolations in a suitable shape space S. For triangulated 3D polygons, we prove that interpolating linearly in this shape space corresponds
Geometric Snakes for Triangular Meshes
, 2002
"... Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In spite of much research in computer vision, automatic feature detection even for images still remains a difficult problem. To avoid this diffic ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
this difficulty, semiautomatic or interactive techniques for image feature detection have been investigated. In this paper, we propose a geometric snake as an interactive tool for feature detection on a 3D triangular mesh. A geometric snake is an extension of an image snake, which is an active contour model
Ray Tracing Triangular Meshes
 In Western Computer Graphics Symposium
, 1995
"... This paper describes two approaches that allow us to intersect rays with triangular meshes more quickly by amortizing computation over neighbouring triangles. The first approach accomplishes this by performing the inout test for each triangle using three plane equations, each one representing a ..."
Abstract
 Add to MetaCart
This paper describes two approaches that allow us to intersect rays with triangular meshes more quickly by amortizing computation over neighbouring triangles. The first approach accomplishes this by performing the inout test for each triangle using three plane equations, each one representing a
VOLUME TRACKING ON TRIANGULAR MESHES
"... ABSTRACT This paper investigates a volume tracking algorithm on triangular meshes, associated with modeling free surface flow and multi phase flow on complex geometry. The volume tracking algorithm is divided into two main tasks. First, a piecewise linear reconstructing the interface is used to app ..."
Abstract
 Add to MetaCart
ABSTRACT This paper investigates a volume tracking algorithm on triangular meshes, associated with modeling free surface flow and multi phase flow on complex geometry. The volume tracking algorithm is divided into two main tasks. First, a piecewise linear reconstructing the interface is used
Metamorphosis of Arbitrary Triangular Meshes
 ABSTRACT TO APPEAR IN IEEE COMPUTER GRAPHICS AND APPLICATIONS
"... Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of threedimensional objects is one of the techniques which realizes shape transformation between two or more existing objects. In this paper, we present an ef ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
an efficient framework for metamorphosis between two topologically equivalent, arbitrary meshes with the control of surface correspondences by the user. The basic idea of our method is to partition meshes according to the reference shapes specified by the user, whereby vertextovertex correspondences between
An Inequality on the Edge Lengths of Triangular Meshes ∗
"... We give a short proof of the following geometric inequality: for any two triangular meshes A and B of the same polygon C, if the number of vertices in A is at most the number of vertices in B, then the maximum length of an edge in A is at least the minimum distance between two vertices in B. Here th ..."
Abstract
 Add to MetaCart
We give a short proof of the following geometric inequality: for any two triangular meshes A and B of the same polygon C, if the number of vertices in A is at most the number of vertices in B, then the maximum length of an edge in A is at least the minimum distance between two vertices in B. Here
Geodesic paths on triangular meshes
 In Proc. of SIBGRAPI/SIACG
, 2004
"... Abstract. We present a new algorithm to compute a geodesic path over a triangulated surface. Based in Sethian’s Fast Marching Method and Polthier’s Straightest Geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and no ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. We present a new algorithm to compute a geodesic path over a triangulated surface. Based in Sethian’s Fast Marching Method and Polthier’s Straightest Geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and nonconvex surfaces as well. 1
Results 1  10
of
1,458