The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Instant field-aligned meshes
Open accessAbstract
We present a novel approach to remesh a surface into an isotropic triangular or quad-dominant mesh using a unified local smoothing operator that optimizes both the edge orientations and vertex positions in the output mesh. Our algorithm produces meshes with high isotropy while naturally aligning and snapping edges to sharp features. The method is simple to implement and parallelize, and it can process a variety of input surface representations, such as point clouds, range scans and triangle meshes. Our full pipeline executes instantly (less than a second) on meshes with hundreds of thousands of faces, enabling new types of interactive workflows. Since our algorithm avoids any global optimization, and its key steps scale linearly with input size, we are able to process extremely large meshes and point clouds, with sizes exceeding several hundred million elements. To demonstrate the robustness and effectiveness of our method, we apply it to hundreds of models of varying complexity and provide our cross-platform reference implementation in the supplemental material.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37422 · Cited by 10,104
Poisson Surface Reconstruction
Kazhdan, M. M., Bolitho, M., & Hoppe, H. (2006) · doi:10.2312/sgp/sgp06/061-070 · Cited by 2,125
Recursively generated B-spline surfaces on arbitrary topological meshes
Catmull, E., & Clark, J. (1978) · Computer-Aided Design · doi:10.1016/0010-4485(78)90110-0 · Cited by 2,018
A signal processing approach to fair surface design
Taubin, G. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218473 · Cited by 1,855
The digital Michelangelo project
Levoy, M. (2003) · Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062) · doi:10.1109/im.1999.805329 · Cited by 1,608
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1993) · Proceedings of the 20th annual conference on Computer graphics and interactive techniques · doi:10.1145/166117.166119 · Cited by 1,303
Computing Discrete Minimal Surfaces and Their Conjugates
Pinkall, U., & Polthier, K. (1993) · Experimental Mathematics · doi:10.1080/10586458.1993.10504266 · Cited by 1,249
Sederberg, T. W., Zheng, J., Bakenov, A., & Nasri, A. (2003) · ACM Transactions on Graphics · doi:10.1145/882262.882295 · Cited by 795
Turk, G. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134008 · Cited by 738
A Survey of Unstructured Mesh Generation Technology.
Owen, S. J. (1998) · Cited by 480
Quad‐Mesh Generation and Processing: A Survey
Bommes, D., Lévy, B., Pietroni, N., Puppo, E., Silva, C., Tarini, M., & Zorin, D. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12014 · Cited by 323
Self-citationVector field design on surfaces
Zhang, E., Mischaikow, K., & Turk, G. (2006) · ACM Transactions on Graphics · doi:10.1145/1183287.1183290 · Cited by 215
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
Micciancio, D. (2001) · SIAM Journal on Computing · doi:10.1137/s0097539700373039 · Cited by 212
Globally optimal direction fields
Knöppel, F., Crane, K., Pinkall, U., & Schröder, P. (2013) · ACM Transactions on Graphics · doi:10.1145/2461912.2462005 · Cited by 195
PriMo : coupled prisms for intuitive surface modeling
Botsch, M., Pauly, M. V., Groß, M. H., & Kobbelt, L. P. (2006) · Cited by 178
Constructing Laplace operator from point clouds in Rd
Belkin, M. A., Sun, J. Z., & Wang, Y. (2009) · doi:10.5555/1496770.1496882 · Cited by 128
Spectral quadrangulation with orientation and alignment control
Huang, J., Zhang, M., Ma, J., Liu, X., Kobbelt, L. P., & Bao, H. (2008) · ACM Transactions on Graphics · doi:10.1145/1409060.1409100 · Cited by 127
Practical quad mesh simplification
Tarini, M., Pietroni, N., Cignoni, P., Panozzo, D., & Puppo, E. (2010) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01610.x · Cited by 119
Self-citationAlmost Isometric Mesh Parameterization through Abstract Domains
Pietroni, N., Tarini, M., & Cignoni, P. (2009) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2009.96 · Cited by 118
Self-citationWait-free parallel algorithms for the union-find problem
Anderson, R., & Woll, H. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103458 · Cited by 108
Geometric modeling based on triangle meshes
Botsch, M., Pauly, M. V., Rössl, C., Bischoff, S., & Kobbelt, L. P. (2006) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/1185657.1185839 · Cited by 104
Panozzo, D., Puppo, E., Tarini, M., et al. (2014) · ACM Transactions on Graphics · doi:10.1145/2601097.2601179 · Cited by 96
Self-citationFrame field generation through metric customization
Jiang, T., Fang, X., Huang, J., Bao, H., Tong, Y., & Desbrun, M. (2015) · ACM Transactions on Graphics · doi:10.1145/2766927 · Cited by 49
Ebke, H., Campen, M., Bommes, D., et al. (2014) · ACM Transactions on Graphics · doi:10.1145/2661229.2661240 · Cited by 42
Cited by
Topology optimization of multi-scale structures: a review
Wu, J., Sigmund, O., & Groen, J. P. (2021) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-021-02881-8 · Cited by 688
The Replica Dataset: A Digital Replica of Indoor Spaces
Straub, J., Whelan, T. J., Ma, L., Chen, Y., Wijmans, E., Green, S., Engel, J. J., Mur-Artal, R., Ren, C. Y., Verma, S., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.05797 · Cited by 357
Ou, C., Buschek, D., Mayer, S., & Butz, A. (2022) · Mensch und Computer 2022 · doi:10.1145/3543758.3543761 · Cited by 7
Metadata
- Authors
- Jakob, W., Tarini, M., Panozzo, D., & Sorkine-Hornung, O.
- Venue
- ACM Transactions on Graphics
- Published
- 2015-11-02
- Volume
- 34
- Issue
- 6
- Pages
- 1-15
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W1973730326
- Cited by
- 341
- References
- 24
- FWCI
- 54.65
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.