Search Results - "Gotsman, C"
-
1
On Landmark Distances in Polygons
Published in Computer graphics forum (01-08-2021)“…We study the landmark distance function between two points in a simply connected planar polygon. We show that if the polygon vertices are used as landmarks,…”
Get full text
Journal Article -
2
Energy-Based Image Deformation
Published in Computer graphics forum (01-07-2009)“…We present a general approach to shape deformation based on energy minimization, and applications of this approach to the problems of image resizing and 2D…”
Get full text
Journal Article -
3
A Complex View of Barycentric Mappings
Published in Computer graphics forum (01-08-2011)“…Barycentric coordinates are very popular for interpolating data values on polyhedral domains. It has been recently shown that expressing them as complex…”
Get full text
Journal Article -
4
3D Surface Reconstruction Using a Generalized Distance Function
Published in Computer graphics forum (01-12-2010)“…We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points…”
Get full text
Journal Article -
5
On the metric properties of discrete space-filling curves
Published in IEEE transactions on image processing (01-05-1996)“…A space-filling curve is a linear traversal of a discrete finite multidimensional space. In order for this traversal to be useful in many applications, the…”
Get full text
Journal Article -
6
Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes
Published in Computer graphics forum (01-06-2002)“…We present methods to generate rendering sequences for triangle meshes which preserve mesh locality as much as possible. This is useful for maximizing vertex…”
Get full text
Journal Article -
7
Antifaces: a novel, fast method for image detection
Published in IEEE transactions on pattern analysis and machine intelligence (01-07-2001)“…This paper offers a novel detection method, which works well even in the case of a complicated image collection. It can also be applied to detect 3D objects…”
Get full text
Journal Article -
8
Fitting curves and surfaces with constrained implicit polynomials
Published in IEEE transactions on pattern analysis and machine intelligence (01-01-1999)“…A problem which often arises while fitting implicit polynomials to 2D and 3D data sets is the following: although the data set is simple, the fit exhibits…”
Get full text
Journal Article -
9
Robust spherical parameterization of triangular meshes
Published in Computing (01-04-2004)“…Parameterization of 3D mesh data is important for many graphics and mesh processing applications, in particular for texture mapping, remeshing and morphing…”
Get full text
Journal Article -
10
High quality compatible triangulations
Published in Engineering with computers (01-07-2004)“…Compatible meshes are isomorphic meshings of the interiors of two polygons having a correspondence between their vertices. Compatible meshing may be used for…”
Get full text
Journal Article -
11
Enhancement by image-dependent warping
Published in IEEE transactions on image processing (1999)“…All image warping algorithms to date are image-independent, namely, relate only to the geometry of the image plane, ignoring the content of the image. We show…”
Get full text
Journal Article -
12
Dynamic scene occlusion culling
Published in IEEE transactions on visualization and computer graphics (01-01-1999)“…Large, complex 3D scenes are best rendered in an output-sensitive way, i.e., in time largely independent of the entire scene model's complexity. Occlusion…”
Get full text
Journal Article -
13
Connectivity shapes
Published in Proceedings Visualization, 2001. VIS '01 (2001)“…We describe a method to visualize the connectivity graph of a mesh using a natural embedding in 3D space. This uses a 3D shape representation that is based…”
Get full text
Conference Proceeding -
14
Efficient coding of non-triangular mesh connectivity
Published in Proceedings the Eighth Pacific Conference on Computer Graphics and Applications (2000)“…Describes an efficient algorithm for coding the connectivity information of general polygon meshes. In contrast to most existing algorithms, which are suitable…”
Get full text
Conference Proceeding -
15
D-Snake: Image Registration by As-Similar-As-Possible Template Deformation
Published in IEEE transactions on visualization and computer graphics (01-02-2013)“…We describe a snake-type method for shape registration in 2D and 3D, by fitting a given polygonal template to an acquired image or volume data. The snake…”
Get full text
Journal Article -
16
Optimized triangle mesh compression using prediction trees
Published in Proceedings the Eighth Pacific Conference on Computer Graphics and Applications (2000)“…Recently, a wealth of algorithms for the efficient coding of 3D triangle meshes have been published. All these focus on achieving the most compact code for the…”
Get full text
Conference Proceeding -
17
Dynamic color quantization of video sequences
Published in IEEE transactions on visualization and computer graphics (01-09-1995)“…We present an efficient algorithm for dynamic adaptive color quantization of 24 bit image (video) sequences, important in multimedia applications. Besides…”
Get full text
Journal Article -
18
Morphing stick figures using optimized compatible triangulations
Published in Proceedings Ninth Pacific Conference on Computer Graphics and Applications. Pacific Graphics 2001 (2001)“…A "stick figure" is a connected straight-line plane graph, sometimes called a "skeleton". Compatible stick figures are those with the same topological…”
Get full text
Conference Proceeding -
19
-
20
P158The role of left atrium in patient with myocardial infarction with ST-segment elevation (STEMI)
Published in European heart journal cardiovascular imaging (01-06-2019)Get full text
Journal Article