Article

Free access

Fast and effective stripification of polygonal surface models

Authors:

Xinyu Xiang,

Martin Held,

Joseph S. B. MitchellAuthors Info & Claims

I3D '99: Proceedings of the 1999 symposium on Interactive 3D graphics

Pages 71 - 78

https://doi.org/10.1145/300523.300531

Published: 26 April 1999 Publication History

PDF eReader

References

[1]

K. Akeley, P. Haeberli, and D. Burns. tomesh, c: C Program on SGI Developer's Toolbarx CD,1990.

Google Scholar

[2]

E.M. Arkin, M. Held, J. S. B. Mitchell, and S. S. Skiena. Hamiltonian Triangulations For Fast Rendering. Visual Comput., 12(9):429-444, I996.

Crossref

Google Scholar

[3]

R. Bar-Yehuda and C. Gotsman. Time/Space Tradeoffs For Polygon Mesh Rendering. ACM Trans. Graph., 15(2):141-152, 1996.

Digital Library

Google Scholar

[4]

M.M. Chow. Optimized Geometry Compression For Real-time Rendering, in IEEE Visualization '97 Proceedings, pages 347-354, San Francisco, CA, 1997. ACM/SIGGRAPH Press.

Digital Library

Google Scholar

[5]

M. Deering, Geometry Comprehension. Comput. Graph, pages 13-20 1995. Proc. SIGGRAPH '95.

Digital Library

Google Scholar

[6]

M. Denny and C. Sohler. Encoding A Triangulation As A Permutation Of Its Point Set. In Proc. 9th Canad. Conf. Comput. Geom., pages 39- 43, 1997.

Google Scholar

[7]

F. Evans. STRIPE: http://www.cs.sunysb.edu/-stripe/, 1998.

Google Scholar

[8]

F. Evans, S. S. Skiena, and A. Varshney. Optimizing Triangle Strips For Fast Rendering. In IEEE Visualization "96 Proceedings, pages 319-326, Oct. 1996.

Digital Library

Google Scholar

[9]

S. Gumhold and W. Strafer. Real Time Comprehenssion Of Triangle Mesh Connectivity. In SIGGRAPH 98 Conference Proceedings, Annual Conference Series, pages 133-140, Orlando, FL, July 1998.

Digital Library

Google Scholar

[10]

M. Held. Efficient And Reliable Triangulation Of Polygons. In Proc. Comput. Graphics Internat., pages 633-643, 1998.

Digital Library

Google Scholar

[11]

B. Speckmann and J. Snoeyink. Easy Triangle Strips For TIN Terrain Models. In Proc. 9th Canad. Conf. Comput. Geom., pages 239-244, 100"7

Google Scholar

[12]

G. Taubin, A. Gu6ziec, W. Horn, and F. Lazarus. Progressive Forest Split Compression. In SIGGRAPH 98 Conference Proceedings, Annual Conference Series, pages 123-132, Orlando, FL, July 1998.

Digital Library

Google Scholar

[13]

G. Taubin and J. Rossignac. Geometric Compression Through Topological Surgery. ACM Trans. Graph., 17: (2)84-115 APR 1998.

Digital Library

Google Scholar

[14]

C. Touma and C. Gotsman. Triangle Mesh Compression. In Proc. 24th Conf. Graphics interface, pages 26-34, San Francisco, CA, 1998. Morgan Kaufmann Publishers.

Google Scholar

Cited By

View all

He XZhang HHan Y(2022)On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphsMathematical Structures in Computer Science10.1017/S0960129522000238(1-17)Online publication date: 30-Aug-2022
https://doi.org/10.1017/S0960129522000238
Borah SBorah B(2020)Prediction Error Expansion (PEE) based Reversible polygon mesh watermarking scheme for regional tamper localizationMultimedia Tools and Applications10.1007/s11042-019-08411-5Online publication date: 6-Jan-2020
https://doi.org/10.1007/s11042-019-08411-5
He XZhang H(2020)On Characterization of Petrie Partitionable Plane GraphsTheory and Applications of Models of Computation10.1007/978-3-030-59267-7_27(313-326)Online publication date: 9-Oct-2020
https://doi.org/10.1007/978-3-030-59267-7_27
Show More Cited By

Index Terms

Fast and effective stripification of polygonal surface models

Recommendations

Simplification of polygonal surface models
A Method for Deforming Polygonal Shapes into Smooth Spline Surface Models
IV '99: Proceedings of the 1999 International Conference on Information Visualisation

This paper describes a new spline formulation that supports deformation of polygonal shapes into smooth spline surface models. Once a polygonal shape with underlying rectangular topology is specified by the user, it is deformed into a smooth surface ...
Polygonal surface remeshing with Delaunay refinement

Polygonal meshes are used to model smooth surfaces in many applications. Often these meshes need to be remeshed for improving the quality, density or gradedness. We apply the Delaunay refinement paradigm to design a provable algorithm for isotropic ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

I3D '99: Proceedings of the 1999 symposium on Interactive 3D graphics

April 1999

237 pages

ISBN:1581130821

DOI:10.1145/300523

Chairmen:
Jarek Rossignac
Georgia Tech, Atlanta
,
Jessica Hodgins
Georgia Tech, Atlanta
,
James D. Foley
Mitsubishi Electric Information Technology Center America

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 April 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

I3D99

Sponsor:

SIGGRAPH

I3D99: 1999 Symposium on Interactive 3D Graphics

April 26 - 29, 1999

Georgia, Atlanta, USA

Acceptance Rates

I3D '99 Paper Acceptance Rate 26 of 105 submissions, 25%;

Overall Acceptance Rate 148 of 485 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
670
Total Downloads

Downloads (Last 12 months)100
Downloads (Last 6 weeks)15

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

He XZhang HHan Y(2022)On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphsMathematical Structures in Computer Science10.1017/S0960129522000238(1-17)Online publication date: 30-Aug-2022
https://doi.org/10.1017/S0960129522000238
Borah SBorah B(2020)Prediction Error Expansion (PEE) based Reversible polygon mesh watermarking scheme for regional tamper localizationMultimedia Tools and Applications10.1007/s11042-019-08411-5Online publication date: 6-Jan-2020
https://doi.org/10.1007/s11042-019-08411-5
He XZhang H(2020)On Characterization of Petrie Partitionable Plane GraphsTheory and Applications of Models of Computation10.1007/978-3-030-59267-7_27(313-326)Online publication date: 9-Oct-2020
https://doi.org/10.1007/978-3-030-59267-7_27
Akenine-Möller THaines EHoffman N(2011)BibliographyReal-Time Rendering, Third Edition10.1201/b10644-23(921-1002)Online publication date: Mar-2011
https://doi.org/10.1201/b10644-23
Šíma JLněnička R(2009)Sequential triangle strip generator based on hopfield networksNeural Computation10.1162/neco.2008.10-07-62321:2(583-617)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1162/neco.2008.10-07-623
Yong-Jin Liu Yu-Kun Lai Shimin Hu (2009)Stripification of Free-Form Surfaces With Global Error Bounds for Developable ApproximationIEEE Transactions on Automation Science and Engineering10.1109/TASE.2008.20099266:4(700-709)Online publication date: Oct-2009
https://doi.org/10.1109/TASE.2008.2009926
Eppstein D(2009)Graph-Theoretic Solutions to Computational Geometry ProblemsGraph-Theoretic Concepts in Computer Science10.1007/978-3-642-11409-0_1(1-16)Online publication date: 4-Dec-2009
https://dl.acm.org/doi/10.1007/978-3-642-11409-0_1
Mamou KZaharia TPrêteux F(2009)TFAN: A low complexity 3D mesh compression algorithmComputer Animation and Virtual Worlds10.1002/cav.31920:2-3(343-354)Online publication date: 11-Jun-2009
https://doi.org/10.1002/cav.319
Cheng IYing LDaniilidis KBasu A(2008)Robust and scalable transmission of arbitrary 3D models over wireless networksJournal on Image and Video Processing10.1155/2008/8904822008(1-14)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.1155/2008/890482
Sander PNehab DChlamtac EHoppe H(2008)Efficient traversal of mesh edges using adjacency primitivesACM SIGGRAPH Asia 2008 papers10.1145/1457515.1409097(1-9)Online publication date: 10-Dec-2008
https://dl.acm.org/doi/10.1145/1457515.1409097
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Simplification of polygonal surface models

A Method for Deforming Polygonal Shapes into Smooth Spline Surface Models

Polygonal surface remeshing with Delaunay refinement