Article

Free access

Converting sets of polygons to manifold surfaces by cutting and stitching

Authors:

Andre Gueziec,

Gabriel Taubin,

Francis Lazarus,

William HornAuthors Info & Claims

SIGGRAPH '98: ACM SIGGRAPH 98 Conference abstracts and applications

Page 245

https://doi.org/10.1145/280953.281628

Published: 21 July 1998 Publication History

PDF eReader

Abstract

No abstract available.

References

[1]

Murali, T.M. and Funkhouser, T.A. Consistent solid and boundary representations from arbitrary polygonal data. 1997 ACM Symposium on Interactive 3D Graphics, 155-161.

Digital Library

Google Scholar

[2]

Barequet, G. and Kumar, S. Repairing CAD models. IEEE Visualization 1997.

Digital Library

Google Scholar

Cited By

View all

Ali SRahmat RKhalid FKhalil H(2014)Rational Equation for Simplifying Complex SurfacesArabian Journal for Science and Engineering10.1007/s13369-014-1067-x39:6(4617-4636)Online publication date: 9-Apr-2014
https://doi.org/10.1007/s13369-014-1067-x
Hagbi NEl-Sana J(2010)Carving for topology simplification of polygonal meshesComputer-Aided Design10.1016/j.cad.2009.04.00142:1(67-75)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1016/j.cad.2009.04.001
Yu FLuo HLu ZWang PYu FLuo HLu ZWang P(2010)3D Mesh CompressionThree-Dimensional Model Analysis and Processing10.1007/978-3-642-12651-2_2(91-160)Online publication date: 2010
https://doi.org/10.1007/978-3-642-12651-2_2
Show More Cited By

Index Terms

Converting sets of polygons to manifold surfaces by cutting and stitching
1. Computing methodologies
  1. Computer graphics
    1. Shape modeling
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Converting sets of polygons to manifold surfaces by cutting and stitching
VIS '98: Proceedings of the conference on Visualization '98
On Polygons Enclosing Point Sets II

Let R and B be disjoint point sets such that R ∪ B is in general position. We say that B encloses by R if there is a simple polygon P with vertex set B such that all the elements in R belong to the interior of P.

In this paper we prove that if the ...
Finitely convergent cutting planes for concave minimization

In 1964 Tuy introduced a new type of cutting plane, the concavity cut, in the context of concave minimization. These cutting planes, which are also known as convexity cuts, intersection cuts and Tuy cuts, have found application in several algorithms, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGGRAPH '98: ACM SIGGRAPH 98 Conference abstracts and applications

July 1998

332 pages

ISBN:1581130465

DOI:10.1145/280953

Chairmen:
Scott Crisson,
Janet McAndless
Enhanced Realities

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: 21 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGGRAPH98

Sponsor:

SIGGRAPH

SIGGRAPH98: The 25th International Conference on Computer Graphics and Interactive Techniques

July 19 - 24, 1998

Florida, Orlando, USA

Acceptance Rates

Overall Acceptance Rate 1,822 of 8,601 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
203
Total Downloads

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

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ali SRahmat RKhalid FKhalil H(2014)Rational Equation for Simplifying Complex SurfacesArabian Journal for Science and Engineering10.1007/s13369-014-1067-x39:6(4617-4636)Online publication date: 9-Apr-2014
https://doi.org/10.1007/s13369-014-1067-x
Hagbi NEl-Sana J(2010)Carving for topology simplification of polygonal meshesComputer-Aided Design10.1016/j.cad.2009.04.00142:1(67-75)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1016/j.cad.2009.04.001
Yu FLuo HLu ZWang PYu FLuo HLu ZWang P(2010)3D Mesh CompressionThree-Dimensional Model Analysis and Processing10.1007/978-3-642-12651-2_2(91-160)Online publication date: 2010
https://doi.org/10.1007/978-3-642-12651-2_2
Akdere MÇetintemel UCrispell DJannotti JMao JTaubin G(2008)Data-Centric Visual Sensor Networks for 3D SensingGeoSensor Networks10.1007/978-3-540-79996-2_8(131-150)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.1007/978-3-540-79996-2_8
Hui ADe Floriani LLevy BManocha D(2007)A two-level topological decomposition for non-manifold simplicial shapesProceedings of the 2007 ACM symposium on Solid and physical modeling10.1145/1236246.1236297(355-360)Online publication date: 4-Jun-2007
https://dl.acm.org/doi/10.1145/1236246.1236297
Liu XYao HGao W(2007)Shape from silhouette outlines using an adaptive dandelion modelComputer Vision and Image Understanding10.1016/j.cviu.2006.09.003105:2(121-130)Online publication date: 1-Feb-2007
https://dl.acm.org/doi/10.1016/j.cviu.2006.09.003
Hui AVaczlavik LDe Floriani LSheffer APolthier K(2006)A decomposition-based representation for 3D simplicial complexesProceedings of the fourth Eurographics symposium on Geometry processing10.5555/1281957.1281970(101-110)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.5555/1281957.1281970
Ryu JByun HLee K(2006)High-quality isosurface generation using an oversampling methodThe International Journal of Advanced Manufacturing Technology10.1007/s00170-004-2136-128:11-12(1161-1168)Online publication date: 24-Mar-2006
https://doi.org/10.1007/s00170-004-2136-1
Peng JKim CJay Kuo C(2005)Technologies for 3D mesh compressionJournal of Visual Communication and Image Representation10.1016/j.jvcir.2005.03.00116:6(688-733)Online publication date: 1-Dec-2005
https://dl.acm.org/doi/10.1016/j.jvcir.2005.03.001
Mesmoudi MDe Floriani LMorando FPuppo E(2005)An Algorithm for Decomposing Multi-dimensional Non-manifold Objects into Nearly Manifold ComponentsAdvances in Multiresolution for Geometric Modelling10.1007/3-540-26808-1_4(75-87)Online publication date: 2005
https://doi.org/10.1007/3-540-26808-1_4
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

Converting sets of polygons to manifold surfaces by cutting and stitching

On Polygons Enclosing Point Sets II

Finitely convergent cutting planes for concave minimization