Article

Free access

The cost of balancing generalized quadtrees

Author:

Doug MooreAuthors Info & Claims

SMA '95: Proceedings of the third ACM symposium on Solid modeling and applications

Pages 305 - 312

https://doi.org/10.1145/218013.218078

Published: 01 December 1995 Publication History

PDF eReader

References

[1]

BANK, R. E., SHERMAN, A. H., AND WEISER, A. Refinement algorithms and data structures for regular local mesh refinement. In Scientific Computing, R. Stepleman et al., Eds. North-Holland Publishing Company, 1983, pp. 3-17.

Google Scholar

[2]

BERN, M., EPPSTEIN. D., AND GILBERT, J. Provably good mesh generation. In 31st IEEE Symposium on Foundations of Computer Science (1990), IEEE.

Digital Library

Google Scholar

[3]

HERSHBERGER, J., AND SURI, S. Efficient computation of Euclidean shortest paths in the plane. In 34th IEEE Symposium on Foundations of Computer Science (1993), IEEE, pp. 508- 517.

Digital Library

Google Scholar

[4]

MrTCHELL, J. S. B., MOUNT, D. M., AND SURf, S. Querysensitive ray shooting. In lOth ACM Symposium on Computational Geometry (19943, ACM, pp. 359-368.

Digital Library

Google Scholar

[5]

MITCHELL, S. A., AND VAVASlS, S. A. Quality mesh generation in three dimensions. In 8th ACM Symposium on Computational Geometry (1992), ACM, pp. 212-221.

Digital Library

Google Scholar

[6]

MOORE, D. Simplicial Mesh Generation with Applications. PhD thesis, Cornell University, 1992.

Digital Library

Google Scholar

[7]

MOORE, D. Understanding simploids. In Graphics Gems III, D. Kirk, Ed. Academic Press. 1992, ch. 5, pp. 250-255.

Digital Library

Google Scholar

[8]

SAMET, H. The Design and Analysis of Spatial Data Structures. Addison Wesley, 1990.

Digital Library

Google Scholar

[9]

VON HERZEN, B., AN{) BARR. A. Accurate triangulations of deformed intersecting surfaces. Computer Graphics 21, 4 (1987), 103-110.

Digital Library

Google Scholar

[10]

WEISER, A. Local-Mesh, Local-Order, Adaptive Finite Element Methods with a Posteriori Error Estimators for Elliptic Partial Differential Equations. PhD thesis, Yale University, 1981.

Digital Library

Google Scholar

Cited By

View all

Wala MKlöckner A(2019)A fast algorithm for Quadrature by Expansion in three dimensionsJournal of Computational Physics10.1016/j.jcp.2019.03.024388:C(655-689)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1016/j.jcp.2019.03.024
Wala MKlöckner A(2018)A fast algorithm with error bounds for Quadrature by ExpansionJournal of Computational Physics10.1016/j.jcp.2018.05.006374:C(135-162)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1016/j.jcp.2018.05.006
Brovka MLópez JEscobar JMontenegro RCascón J(2016)A simple strategy for defining polynomial spline spaces over hierarchical T-meshesComputer-Aided Design10.1016/j.cad.2015.06.00872:C(140-156)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1016/j.cad.2015.06.008
Show More Cited By

Index Terms

The cost of balancing generalized quadtrees
1. Computing methodologies
  1. Computer graphics
    1. Graphics systems and interfaces
    2. Shape modeling
      1. Parametric curve and surface models
      2. Volumetric models
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

TECHNICAL NOTE---Inventory Systems with a Generalized Cost Model

We study a single-stage inventory system with a generalized shortage penalty cost that includes the following three components: (i) a cost that is an increasing function of the number of backordered units in a period, (ii) a fixed cost incurred for each ...
Navigating through triangle meshes implemented as linear quadtrees

Techniques are presented for navigating between adjacent triangles of greater or equal size in a hierarchical triangle mesh where the triangles are obtained by a recursive quadtree-like subdivision of the underlying space into four equilateral triangles. ...
Generalized Unstructured Decimation

This article presents a general algorithm for decimating unstructured discretized data sets. The discretized space may be a planar triangulation, a general 3D surface triangulation, or a 3D tetrahedrization. Local dynamic vertex removal is performed ...

Comments

Information & Contributors

Information

Published In

SMA '95: Proceedings of the third ACM symposium on Solid modeling and applications

December 1995

448 pages

ISBN:0897916727

DOI:10.1145/218013

Editors:
Chris Hoffmann
Purdue Univ., Lafayette, IN
,
Jarek Rossignac
IBM research

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: 01 December 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

3SOLID95

Sponsor:

SIGGRAPH

3SOLID95: Third ACM SIGGRAPH Symposium on Solid Modeling & Applications

May 17 - 19, 1995

Utah, Salt Lake City, USA

Acceptance Rates

Overall Acceptance Rate 86 of 173 submissions, 50%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
608
Total Downloads

Downloads (Last 12 months)68
Downloads (Last 6 weeks)11

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wala MKlöckner A(2019)A fast algorithm for Quadrature by Expansion in three dimensionsJournal of Computational Physics10.1016/j.jcp.2019.03.024388:C(655-689)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1016/j.jcp.2019.03.024
Wala MKlöckner A(2018)A fast algorithm with error bounds for Quadrature by ExpansionJournal of Computational Physics10.1016/j.jcp.2018.05.006374:C(135-162)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1016/j.jcp.2018.05.006
Brovka MLópez JEscobar JMontenegro RCascón J(2016)A simple strategy for defining polynomial spline spaces over hierarchical T-meshesComputer-Aided Design10.1016/j.cad.2015.06.00872:C(140-156)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1016/j.cad.2015.06.008
Kang JJiang BChen JLiu X(2014)Stereoscopic Image Recoloring via Consistent Intrinsic DecompositionProceedings of the 2014 International Conference on Virtual Reality and Visualization10.1109/ICVRV.2014.10(272-277)Online publication date: 30-Aug-2014
https://dl.acm.org/doi/10.1109/ICVRV.2014.10
Bennett HYap C(2014)Amortized Analysis of Smooth Quadtrees in All DimensionsAlgorithm Theory – SWAT 201410.1007/978-3-319-08404-6_4(38-49)Online publication date: 2014
https://doi.org/10.1007/978-3-319-08404-6_4
Plath NKnorr SGoldmann LSikora T(2013)Adaptive Image Warping for Hole Prevention in 3D View SynthesisIEEE Transactions on Image Processing10.1109/TIP.2013.226894022:9(3420-3432)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1109/TIP.2013.2268940
Gibou FMin CFedkiw R(2013)High Resolution Sharp Computational Methods for Elliptic and Parabolic Problems in Complex GeometriesJournal of Scientific Computing10.1007/s10915-012-9660-154:2-3(369-413)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1007/s10915-012-9660-1
Edelsbrunner HKerber M(2012)Dual Complexes of Cubical Subdivisions of źnDiscrete & Computational Geometry10.5555/3115956.311602447:2(393-414)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.5555/3115956.3116024
Sheehy D(2012)New Bounds on the Size of Optimal MeshesComputer Graphics Forum10.1111/j.1467-8659.2012.03168.x31:5(1627-1635)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1111/j.1467-8659.2012.03168.x
Acar UCotter AHudson BTürkoglu DMeyer auf der Heide FRajaraman R(2011)Parallelism in dynamic well-spaced point setsProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989498(33-42)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1989493.1989498
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

TECHNICAL NOTE---Inventory Systems with a Generalized Cost Model

Navigating through triangle meshes implemented as linear quadtrees

Generalized Unstructured Decimation

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

TECHNICAL NOTE---Inventory Systems with a Generalized Cost Model

Navigating through triangle meshes implemented as linear quadtrees

Generalized Unstructured Decimation

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations