vcglib/apps/tridecimator/readme.txt

77 lines
3.6 KiB
Plaintext
Raw Normal View History

2005-10-01 23:24:00 +02:00
VCGLib http://vcg.sf.net o o
Visual and Computer Graphics Library o o
_ O _
Copyright(C) 2005-2006 \/)\/
Visual Computing Lab http://vcg.isti.cnr.it /\/|
ISTI - Italian National Research Council |
\
2005-11-12 19:20:25 +01:00
TriDecimator 1.00 2/10/2005
2005-10-01 23:24:00 +02:00
All rights reserved.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License (http://www.gnu.org/licenses/gpl.txt)
for more details.
--- Synopsis ---
2005-11-12 19:20:25 +01:00
tridecimator fileIn fileOut face_num [opt]\
Where opt can be:\
-e# QuadricError threshold (range [0,inf) default inf)
-b# Boundary Weight (default .5)
-q# Quality threshold (range [0.0, 0.866], default .3 )
-n# Normal threshold (degree range [0,180] default 90)
-E# Minimal admitted quadric value (default 1e-15, must be >0)
-Q[y|n] Use or not Quality Threshold (default yes)
-N[y|n] Use or not Normal Threshold (default no)
-A[y|n] Use or not Area Weighted Quadrics (default yes)
-O[y|n] Use or not vertex optimal placement (default yes)
-S[y|n] Use or not Scale Independent quadric measure(default yes)
-B[y|n] Preserve or not mesh boundary (default no)
-T[y|n] Preserve or not Topology (default no)
-H[y|n] Use or not Safe Heap Update (default no)
-P Before simplification, remove duplicate & unreferenced vertices
2005-10-01 23:24:00 +02:00
2005-11-12 19:20:25 +01:00
Supported formats: PLY, OFF, STL
2005-10-01 23:24:00 +02:00
2005-11-12 19:20:25 +01:00
-- Some technical notes --
2005-10-01 23:24:00 +02:00
2005-11-12 19:20:25 +01:00
This simplification tool employ a quadric error based edge collapse iterative approach.
Each possible collapse is scored taking into account
- its quadric error
- its quadric boundary error
- the normal variation caused by the collapse itself
- the future quality (aspect ratio) of the triangles involved in the collapse
2005-10-01 23:24:00 +02:00
2005-11-12 19:20:25 +01:00
The simplification can ends when the desired number of triangles has been reached.
2005-10-01 23:24:00 +02:00
2005-11-12 19:20:25 +01:00
The 'Safe Heap Update' change the set of edges re-inserted in the heap
after a collapse resulting in a vertex v; this option put back in the
heap not only incident in the vbut all the edges of the triangles incident
in v. It slows down a lot.
2005-10-01 23:24:00 +02:00
2005-11-12 19:20:25 +01:00
The 'Scale Independent quadric' is useful when you want simplify
two different meshes at the same 'error'; otherwise the quadric
error used in the heap is somewhat normalized and independent
of the size of the mesh.
2005-10-01 23:24:00 +02:00
2005-11-12 19:20:25 +01:00
The Normal threshold avoid to make large changes in variation of the normal
of the surfaces, but on the other hand it prevent the removal of small 'folded'
triangles that can be already present. Therefore in most cases is not very useful.
2005-10-01 23:24:00 +02:00
2005-11-12 19:20:25 +01:00
Cleaning the mesh is mandatory for some input format like STL that always
duplicates all the vertices.
2005-10-01 23:24:00 +02:00