The DOI matches its Crossref record.
New quadric metric for simplifying meshes with appearance attributes
Abstract
Complex triangle meshes arise naturally in many areas of computer graphics and visualization. Previous work has shown that a quadric error metric allows fast and accurate geometric simplification of meshes. This quadric approach was recently generalized to handle meshes with appearance attributes. In this paper we present an improved quadric error metric for simplifying meshes with attributes. The new metric, based on geometric correspondence in 3D, requires less storage, evaluates more quickly, and results in more accurate simplified meshes. Meshes often have attribute discontinuities, such as surface creases and material boundaries, which require multiple attribute vectors per vertex. We show that a wedge-based mesh data structure captures such discontinuities efficiently and permits simultaneous optimization of these multiple attribute vectors. In addition to the new quadric metric, we experiment with two techniques proposed in geometric simplification, memoryless simplification and volume preservation, and show that both of these are beneficial within the quadric framework. The new scheme is demonstrated on a variety of meshes with colors and normals.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
MeshCNN: a network with an edge
Hanocka, R., Hertz, A., Fish, N., Giryes, R., Fleishman, S., & Cohen-Or, D. (2019) · ACM Transactions on Graphics · doi:10.1145/3306346.3322959 · Cited by 742
A Survey Of Free-Form Object Representation and Recognition Techniques
Campbell, R. J., & Flynn, P. J. (2001) · Computer Vision and Image Understanding · doi:10.1006/cviu.2000.0889 · Cited by 509
Automatic Liver Segmentation Based on Shape Constraints and Deformable Graph Cut in CT Images
Li, G., Chen, X., Shi, F., Zhu, W., Tian, J., & Xiang, D. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2481326 · Cited by 185
Petascale neural circuit reconstruction: automated methods
Macrina, T., Lee, K., Lu, R., Turner, N. L., Wu, J., Popovych, S., Silversmith, W., Kemnitz, N., Bae, J. A., Castro, M. A., et al. (2021) · doi:10.1101/2021.08.04.455162 · Cited by 55
Metadata
- Authors
- Hoppe, H.
- Venue
- Proceedings Visualization '99 (Cat. No.99CB37067)
- Publisher
- IEEE
- Published
- 2003-01-20
- Pages
- 59-510
- OpenAlex
- W3150574965
- Cited by
- 229
- References
- 0
- FWCI
- 8.12
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.