article

Efficient compression of non-manifold polygonal meshes

Authors:

André Guéziec,

Frank Bossen,

Gabriel Taubin,

Claudio SilvaAuthors Info & Claims

Computational Geometry: Theory and Applications, Volume 14, Issue 1-3

Pages 137 - 166

https://doi.org/10.1016/S0925-7721(99)00027-9

Published: 01 November 1999 Publication History

Abstract

No abstract available.

Cited By

View all

Polishchuk VSysikaski M(2011)Faster algorithms for minimum-link paths with restricted orientationsProceedings of the 12th international conference on Algorithms and data structures10.5555/2033190.2033246(655-666)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.5555/2033190.2033246
Chepoi VDragan FEstellon BHabib MVaxès YTeillaud M(2008)Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphsProceedings of the twenty-fourth annual symposium on Computational geometry10.1145/1377676.1377687(59-68)Online publication date: 9-Jun-2008
https://dl.acm.org/doi/10.1145/1377676.1377687
Nilsson B(2005)Approximate guarding of monotone and rectilinear polygonsProceedings of the 32nd international conference on Automata, Languages and Programming10.1007/11523468_110(1362-1373)Online publication date: 11-Jul-2005
https://dl.acm.org/doi/10.1007/11523468_110
Show More Cited By

Index Terms

Efficient compression of non-manifold polygonal meshes
1. Computing methodologies
  1. Computer graphics
    1. Image compression
    2. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Efficient compression of non-manifold polygonal meshes
VIS '99: Proceedings of the conference on Visualization '99: celebrating ten years

We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold ...
Efficient Compression of Non-Manifold Polygonal Meshes
VISUALIZATION '99: Proceedings of the 10th IEEE Visualization 1999 Conference (VIS '99)

We present a method for compressing non-manifold polygonalmeshes, i.e. polygonal meshes with singularities, which occur veryfrequently in the real-world. Most efficient polygonal compressionmethods currently available are restricted to a manifold mesh: ...
Untangling polygonal and polyhedral meshes via mesh optimization

We propose simple and efficient optimization-based untangling strategies for 2D polygonal and 3D polyhedral meshes. The first approach uses a size-based mesh metric, which eliminates inverted elements by averaging element size over the entire mesh. The ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computational Geometry: Theory and Applications

Computational Geometry: Theory and Applications Volume 14, Issue 1-3

Special issue on multi-resolution modelling and 3D geometry compression

Nov. 1999

160 pages

ISSN:0925-7721

Editors:
Jöorg-Rüdger Sack
Carleton Univ., Ont., Canada
,
A. Guéziec
Carleton Univ., Ont., Canada
,
G. Taubin

Issue’s Table of Contents

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 November 1999

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Polishchuk VSysikaski M(2011)Faster algorithms for minimum-link paths with restricted orientationsProceedings of the 12th international conference on Algorithms and data structures10.5555/2033190.2033246(655-666)Online publication date: 15-Aug-2011
https://dl.acm.org/doi/10.5555/2033190.2033246
Chepoi VDragan FEstellon BHabib MVaxès YTeillaud M(2008)Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphsProceedings of the twenty-fourth annual symposium on Computational geometry10.1145/1377676.1377687(59-68)Online publication date: 9-Jun-2008
https://dl.acm.org/doi/10.1145/1377676.1377687
Nilsson B(2005)Approximate guarding of monotone and rectilinear polygonsProceedings of the 32nd international conference on Automata, Languages and Programming10.1007/11523468_110(1362-1373)Online publication date: 11-Jul-2005
https://dl.acm.org/doi/10.1007/11523468_110
Gandoin PDevillers O(2002)Progressive lossless compression of arbitrary simplicial complexesACM Transactions on Graphics (TOG)10.1145/566654.56659121:3(372-379)Online publication date: 1-Jul-2002
https://dl.acm.org/doi/10.1145/566654.566591
Gandoin PDevillers OAppolloni T(2002)Progressive lossless compression of arbitrary simplicial complexesProceedings of the 29th annual conference on Computer graphics and interactive techniques10.1145/566570.566591(372-379)Online publication date: 23-Jul-2002
https://dl.acm.org/doi/10.1145/566570.566591
De Floriani LMagillo PPuppo ESobrero DSeidel HShapiro VLee KPatrikalakis N(2002)A multi-resolution topological representation for non-manifold meshesProceedings of the seventh ACM symposium on Solid modeling and applications10.1145/566282.566307(159-170)Online publication date: 17-Jun-2002
https://dl.acm.org/doi/10.1145/566282.566307
Yang CLee DWong C(1997)The Smallest Pair of Noncrossing Paths in a Rectilinear PolygonIEEE Transactions on Computers10.1109/12.60928046:8(930-941)Online publication date: 1-Aug-1997
https://dl.acm.org/doi/10.1109/12.609280
Arkin EMitchell JSuri SFrederickson G(1992)Optimal link path queries in a simple polygonProceedings of the third annual ACM-SIAM symposium on Discrete algorithms10.5555/139404.139462(269-279)Online publication date: 1-Sep-1992
https://dl.acm.org/doi/10.5555/139404.139462
de Berg Mvan Kreveld MNilsson BDrysdale R(1991)Shortest path queries in rectilinear worlds of higher dimension (extended abstract)Proceedings of the seventh annual symposium on Computational geometry10.1145/109648.109654(51-60)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109648.109654

Abstract

Cited By

Index Terms

Recommendations

Efficient compression of non-manifold polygonal meshes

Efficient Compression of Non-Manifold Polygonal Meshes

Untangling polygonal and polyhedral meshes via mesh optimization

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations