SILHOUETTE DETECTION FOR ADAPTIVE POLYGONAL MESH SIMPLIFICATION USING DISTANCE TRANSFORMS

2006 ◽  
Keyword(s):  
Mesh Simplification ◽  
Polygonal Mesh ◽  
Distance Transforms ◽  
Silhouette Detection

The Storage Independent Polygonal Mesh Simplification System

2007 ◽  
pp. 3-12
Author(s):  
Hung-Kuang Chen ◽  
Chin-Shyurng Fahn ◽  
Ming-Bo Lin
Keyword(s):  
Mesh Simplification ◽  
Polygonal Mesh

Superfaces: polygonal mesh simplification with bounded error

1996 ◽  
Vol 16 (3) ◽  
pp. 64-77 ◽  
Author(s):  
A.D. Kalvin ◽  
R.H. Taylor
Keyword(s):  
Mesh Simplification ◽  
Polygonal Mesh ◽  
Bounded Error

scholarly journals A New Simplification Algorithm for Colored or Textured Polygonal Models

2000 ◽  
Vol 4 (4) ◽  
pp. 1-20 ◽  
Author(s):  
Kun Zhou ◽  
Mingmin Zhang ◽  
Jiaoying Shi ◽  
Zhigeng Pan
Keyword(s):  
Measuring Method ◽  
Mesh Simplification ◽  
Level Of Detail ◽  
Continuous Transition ◽  
Polygonal Mesh ◽  
Adaptive Subdivision ◽  
Lod Models ◽  
Textured Models ◽  
Polygonal Models ◽  
Vertex Clustering

Many applications in computer graphics require complex and highly detailed models. However, the level of detail actually necessary may vary considerably. It is often desirable to use approximations in place of excessively detailed models to control processing time. A new polygonal mesh simplification algorithm is presented for colored or textured models based on vertex clustering, and a more accurate error-measuring method for vertex clustering is introduced. The algorithm can produce high quality approximations of polygonal models. It makes adaptive subdivision of the bounding box in the original model using octree structure and performs vertex clustering in an error range specified by users. The color or texture information defined over the mesh can be preserved during simplification by constructing a texture map for the simplified mesh. To make a continuous transition between level of detail (LoD) models possible, an efficient interpolating method is also proposed. The efficiency of the algorithm is demonstrated in the experimental results.

scholarly journals Applying 3D Polygonal Mesh Watermarking for Transmission Security Protection through Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Roland Hu ◽  
Li Xie ◽  
Huimin Yu ◽  
Baocang Ding
Keyword(s):  
Sensor Networks ◽  
Copyright Protection ◽  
Mesh Simplification ◽  
Majority Voting ◽  
Blind Watermarking ◽  
Digital Right Management ◽  
Security Issue ◽  
Polygonal Mesh ◽  
3D Data ◽  
Voting Scheme

Although many research works have been carried out in the area of transmission 3D data through sensor networks, the security issue of transmission remains to be unsolved. It is important to develop systems for copyright protection and digital right management (DRM). In this paper, a blind watermarking algorithm is proposed to protect the transmission security of 3D polygonal meshes through sensor networks. Our method is based on selecting prominent feature vertices (prongs) on the mesh and then embedding the same watermark into their neighborhood regions. The embedding algorithm is based on modifying the distribution of vertex norms by using quadratic programming (QP). Decoding results are obtained by a majority voting scheme over neighborhood regions of these prongs. Assuming that cropping cannot remove all prongs, we can achieve robustness against the cropping attack both theoretically and experimentally. Experiments indicate that the proposed method is also robust against noise, smoothing, and mesh simplification. The proposed method has provided a solution for 3D polygonal watermarking which is potential to withstand a variety of attacks.

scholarly journals SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS

2003 ◽  
Vol 13 (01) ◽  
pp. 61-94 ◽  
Author(s):  
JONATHAN COHEN ◽  
DINESH MANOCHA ◽  
MARC OLANO
Keyword(s):  
Error Bounds ◽  
Mapping Function ◽  
Linear Mapping ◽  
Mesh Simplification ◽  
Orthogonal Projections ◽  
Polygonal Mesh ◽  
Levels Of Detail ◽  
Guaranteed Error Bounds ◽  
Surface Deviation ◽  
Edge Collapse

We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function for each simplification operation and use this function to measure deviation of the new surface from both the previous level of detail and from the original surface. In addition, we use the mapping function to compute appropriate texture coordinates if the original model has texture coordinates at its vertices. Our overall algorithm uses edge collapse operations. We present rigorous procedures for the generation of local orthogonal projections to the plane as well as for the selection of a new vertex position resulting from the edge collapse operation. The algorithm computes guaranteed error bounds on surface deviation and produces an entire continuum of levels of detail with mappings between them. We demonstrate the effectiveness of our algorithm on several models: a Ford Bronco consisting of over 300 parts and 70, 000 triangles, a textured lion model consisting of 49 parts and 86, 000 triangles, a textured, wrinkled torus consisting of 79, 000 triangles, a dragon model consisting of 871, 000 triangles, a Buddha model consisting of 1,000,000 triangles, and an armadillo model consisting of 2, 000, 000 triangles.

Feature Preserving Mesh Simplification Algorithm Based on Square Volume Measure

2009 ◽  
Vol 32 (2) ◽  
pp. 203-212 ◽  
Author(s):  
Yuan-Feng ZHOU ◽  
Cai-Ming ZHANG ◽  
Ping HE
Keyword(s):  
Mesh Simplification ◽  
Volume Measure ◽  
Feature Preserving
Sign in / Sign up

Export Citation Format

Share Document