Results 1 - 10 of 1,925

Topology Simplification Algorithm

by Sylvain Jaume , 2004
"... "Topology simplification algorithm for the segmentation of medical scans / Algorithme de simplification topologique pour la segmentation d'images médicales volumétriques" ..."
Abstract - Add to MetaCart
"Topology simplification algorithm for the segmentation of medical scans / Algorithme de simplification topologique pour la segmentation d'images médicales volumétriques"

Survey of Polygonal Surface Simplification Algorithms

by Paul S. Heckbert, Michael Garland , 1997
"... This paper surveys methods for simplifying and approximating polygonal surfaces. A polygonal surface is a piecewiselinear surface in 3-D defined by a set of polygons ..."
Abstract - Cited by 227 (3 self) - Add to MetaCart
This paper surveys methods for simplifying and approximating polygonal surfaces. A polygonal surface is a piecewiselinear surface in 3-D defined by a set of polygons

A Comparison of Mesh Simplification Algorithms

by P. Cignoni, C. Montani, R. Scopigno - Computers & Graphics , 1997
"... In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only due to rendering speed reasons, but also to allow fast transmission of 3D models in network-based applications. Many different approaches and algorithms for mesh sim ..."
Abstract - Cited by 167 (8 self) - Add to MetaCart
In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only due to rendering speed reasons, but also to allow fast transmission of 3D models in network-based applications. Many different approaches and algorithms for mesh

LINE SIMPLIFICATION ALGORITHMS

by George Taylor
"... Work on the generalisation of cartographic line data, so that small scale map data can be derived from larger scales, has led to the development of algorithms for a variety of generalisation operations, including line simplification. A major objective when capturing linear digital map data is the cr ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Work on the generalisation of cartographic line data, so that small scale map data can be derived from larger scales, has led to the development of algorithms for a variety of generalisation operations, including line simplification. A major objective when capturing linear digital map data

Point-based simplification algorithm

by Pai-feng Lee, Bin-shyan Jong, Department Of Information Management - WSEAS Trans. Comp. Res
"... Abstract:- This study presents a novel, rapid, and effective point simplification algorithm based on a point cloud without any normal and connectivity information. This study is initiated with a scattered sampled point set in three dimensions, and the final output is a triangular mesh model, which i ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract:- This study presents a novel, rapid, and effective point simplification algorithm based on a point cloud without any normal and connectivity information. This study is initiated with a scattered sampled point set in three dimensions, and the final output is a triangular mesh model, which

Assessment of Mesh Simplification Algorithm Quality

by Michael Roy, Frederic Nicolier, Sebti Foufou, Frederic Truchetet, Andreas Koschan, Mongi Abidi , 2002
"... This paper describes a method to compare an original mesh and its simplified representation. Meshes considered here contain geometric features as well as other surface attributes such as material colors, texture, temperature, and radiation, etc. Many simplification algorithms have been presented in ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This paper describes a method to compare an original mesh and its simplified representation. Meshes considered here contain geometric features as well as other surface attributes such as material colors, texture, temperature, and radiation, etc. Many simplification algorithms have been presented

Speeding Up the Douglas-Peucker Line-Simplification Algorithm

by John Hershberger, Jack Snoeyink - Proc. 5th Intl. Symp. on Spatial Data Handling , 1992
"... We analyze the line simplification algorithm reported by Douglas and Peucker and show that its worst case is quadratic in n, the number of input points. Then we give a algorithm, based on path hulls, that uses the geometric structure of the problem to attain a worst-case running time proportional to ..."
Abstract - Cited by 96 (3 self) - Add to MetaCart
We analyze the line simplification algorithm reported by Douglas and Peucker and show that its worst case is quadratic in n, the number of input points. Then we give a algorithm, based on path hulls, that uses the geometric structure of the problem to attain a worst-case running time proportional

Surface Simplification Using Quadric Error Metrics

by Michael Garland, Paul S. Heckbert
"... Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplifi ..."
Abstract - Cited by 1174 (16 self) - Add to MetaCart
simplification algorithm which can rapidly produce high quality approximations of polygonal models. The algorithm uses iterative contractions of vertex pairs to simplify models and maintains surface error approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm

A New Point Cloud Simplification Algorithm

by Carsten Moenning, Neil A. Dodgson - In Proceedings 3rd IASTED Conference on Visualization, Imaging and Image Processing , 2003
"... We present a new technique for the simplification of pointsampled geometry without any prior surface reconstruction. Using Fast Marching farthest point sampling for implicit surfaces and point clouds [1], we devise a coarse-tofine uniform or feature-sensitive simplification algorithm with user-contr ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
We present a new technique for the simplification of pointsampled geometry without any prior surface reconstruction. Using Fast Marching farthest point sampling for implicit surfaces and point clouds [1], we devise a coarse-tofine uniform or feature-sensitive simplification algorithm with user

A Simplification Algorithm for Visualizing the Structure of Complex Graphs

by Daniel Hennessey, Daniel Brooks, Alex Fridman, David Breen
"... Complex graphs, ones containing thousands of nodes of high degree, are difficult to visualize. Displaying all of the nodes and edges of these graphs can create an incomprehensible cluttered output. This paper presents a simplification algorithm that may be applied to a complex graph in order to prod ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Complex graphs, ones containing thousands of nodes of high degree, are difficult to visualize. Displaying all of the nodes and edges of these graphs can create an incomprehensible cluttered output. This paper presents a simplification algorithm that may be applied to a complex graph in order
Results 1 - 10 of 1,925