Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/177424.177975acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
Article
Free access

Bounds on the size of tetrahedralizations

Published: 10 June 1994 Publication History
  • Get Citation Alerts
  • First page of PDF

    References

    [1]
    Aronov, B., Sharir, M. Triangles in space or building (and analyzing) castles in the air, Combinatorica, 10 (1990), 137-173.
    [2]
    Aronov, B., Sharir, M. The Union of convex polyhedra in three dimensions, Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci. (1993), 518-527.
    [3]
    Aronov, B., Sharir, M. Castles in the air revisited, Proc. 8th Annu. ACM Sympos. Comput. Geom. (1992), 146-156.
    [4]
    Bajaj, C.L., Dey, T.K. Convex Decompositions of Polyhedra and Robustness, SIAM Journal on Computing 21 (1992), 339-364.
    [5]
    Bern, M. Compatible tetrahedralizations, Proc. 9th Annu. ACM Sympos. Comput. Geom. (1993), 281- 288.
    [6]
    Chazelle, B. Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm, SiAM Journal on Computing, 13 (1984), 488-507.
    [7]
    Chazelle, B. An optimal algorithm for intersecting three-dimensional convex polyhedra, SIAM Journal on Computing, 21 (1992), 671-696.
    [8]
    Chazelle, B., Palios, L. Triangulating a nonconvex polytope, Discrete and Computational Geometry, 5 (199o), 5os-5
    [9]
    Dey, T.K. Triangulation and CSG representation of polyhedra with arbitrary genus, Proc. 7th Annu. ACM Sympos. Comput. Geom. (1991), 364-372.
    [10]
    Dobkin, D.P., Kirkpatrick, D.G. Fast detection of polyhedral intersection, Theoret. Comput. Sci. 27 (1983), 241-253.
    [11]
    Dobkin, D.P., Laszlo, M.J. Primiiives for the manipulation of three-dimensional subdivisions, Algorithmica, 4 (1989), 3-32.
    [12]
    Martin, A. A simple primal algorithm for intersecting 3-polyhedra in linear time, Tech. Report 91-16, July 1991.
    [13]
    Mehlhorn, K. Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry, Springer-Verlag, Heidelberg, Germany, 1984.
    [14]
    Mulmuley, K. Computational Geometry: An Introduction Through Randomized Algoriihms, Prentice-Hall, 1994.
    [15]
    Pellegrini, M. Building convex space partitions induced by pairwise interior-disjoint simplices, ICSI TR-93-039, Aug. 1993.
    [16]
    Ruppert, J., Seidel, R. On the difficul;ly of triangulating three-dimensional non-convex polyhedra, Discrete and Computational Geometry, 7 (1992), 227-253.
    [17]
    SchSnhardt, E. Uber die Zerlegung von Dreieckspolyedern in Telraeder, Math. Annalen, 98 (1928), 309-312.

    Cited By

    View all

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SCG '94: Proceedings of the tenth annual symposium on Computational geometry
    June 1994
    400 pages
    ISBN:0897916484
    DOI:10.1145/177424
    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]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 10 June 1994

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    SCG94
    SCG94: Tenth Symposium on Computational Geometry
    June 6 - 8, 1994
    New York, Stony Brook, USA

    Acceptance Rates

    Overall Acceptance Rate 625 of 1,685 submissions, 37%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)24
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 26 Jul 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2001)2D and 3D finite element meshing and remeshingEngineering Computations10.1108/EUM000000000649518:8(1108-1197)Online publication date: 1-Dec-2001
    • (2000)Tetrahedralization of Two Nested Convex PolyhedraComputing and Combinatorics10.1007/3-540-44968-X_29(291-298)Online publication date: 21-Jul-2000
    • (1996)Linear complexity hexahedral mesh generationProceedings of the twelfth annual symposium on Computational geometry10.1145/237218.237237(58-67)Online publication date: 1-May-1996
    • (1995)Strategies for polyhedral surface decompositionProceedings of the eleventh annual symposium on Computational geometry10.1145/220279.220311(297-305)Online publication date: 1-Sep-1995
    • (1995)Stabbing triangulations by lines in 3DProceedings of the eleventh annual symposium on Computational geometry10.1145/220279.220308(267-276)Online publication date: 1-Sep-1995
    • (1994)Computational geometryProceedings of the twenty-sixth annual ACM symposium on Theory of Computing10.1145/195058.195110(75-94)Online publication date: 23-May-1994

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media