Progressive embedding

Hanxiao Shen, Zhongshi Jiang, Denis Zorin, Daniele Panozzo

Research output: Contribution to journalArticle

Abstract

Tutte embedding is one of the most common building blocks in geometry processing algorithms due to its simplicity and provable guarantees. Although provably correct in infinite precision arithmetic, it fails in challenging cases when implemented using floating point arithmetic, largely due to the induced exponential area changes. We propose Progressive Embedding, with similar theoretical guarantees to Tutte embedding, but more resilient to the rounding error of floating point arithmetic. Inspired by progressive meshes, we collapse edges on an invalid embedding to a valid, simplified mesh, then insert points back while maintaining validity. We demonstrate the robustness of our method by computing embeddings for a large collection of disk topology meshes. By combining our robust embedding with a variant of the matchmaker algorithm, we propose a general algorithm for the problem of mapping multiply connected domains with arbitrary hard constraints to the plane, with applications in texture mapping and remeshing.

Original languageEnglish (US)
Article number32
JournalACM Transactions on Graphics
Volume38
Issue number4
DOIs
StatePublished - Jul 2019

Fingerprint

Digital arithmetic
Textures
Topology
Geometry
Processing

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

Cite this

Progressive embedding. / Shen, Hanxiao; Jiang, Zhongshi; Zorin, Denis; Panozzo, Daniele.

In: ACM Transactions on Graphics, Vol. 38, No. 4, 32, 07.2019.

Research output: Contribution to journalArticle

Shen, Hanxiao ; Jiang, Zhongshi ; Zorin, Denis ; Panozzo, Daniele. / Progressive embedding. In: ACM Transactions on Graphics. 2019 ; Vol. 38, No. 4.
@article{cb6d794e40224721a226f7885fcb73f2,
title = "Progressive embedding",
abstract = "Tutte embedding is one of the most common building blocks in geometry processing algorithms due to its simplicity and provable guarantees. Although provably correct in infinite precision arithmetic, it fails in challenging cases when implemented using floating point arithmetic, largely due to the induced exponential area changes. We propose Progressive Embedding, with similar theoretical guarantees to Tutte embedding, but more resilient to the rounding error of floating point arithmetic. Inspired by progressive meshes, we collapse edges on an invalid embedding to a valid, simplified mesh, then insert points back while maintaining validity. We demonstrate the robustness of our method by computing embeddings for a large collection of disk topology meshes. By combining our robust embedding with a variant of the matchmaker algorithm, we propose a general algorithm for the problem of mapping multiply connected domains with arbitrary hard constraints to the plane, with applications in texture mapping and remeshing.",
author = "Hanxiao Shen and Zhongshi Jiang and Denis Zorin and Daniele Panozzo",
year = "2019",
month = "7",
doi = "10.1145/3306346.3323012",
language = "English (US)",
volume = "38",
journal = "ACM Transactions on Graphics",
issn = "0730-0301",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Progressive embedding

AU - Shen, Hanxiao

AU - Jiang, Zhongshi

AU - Zorin, Denis

AU - Panozzo, Daniele

PY - 2019/7

Y1 - 2019/7

N2 - Tutte embedding is one of the most common building blocks in geometry processing algorithms due to its simplicity and provable guarantees. Although provably correct in infinite precision arithmetic, it fails in challenging cases when implemented using floating point arithmetic, largely due to the induced exponential area changes. We propose Progressive Embedding, with similar theoretical guarantees to Tutte embedding, but more resilient to the rounding error of floating point arithmetic. Inspired by progressive meshes, we collapse edges on an invalid embedding to a valid, simplified mesh, then insert points back while maintaining validity. We demonstrate the robustness of our method by computing embeddings for a large collection of disk topology meshes. By combining our robust embedding with a variant of the matchmaker algorithm, we propose a general algorithm for the problem of mapping multiply connected domains with arbitrary hard constraints to the plane, with applications in texture mapping and remeshing.

AB - Tutte embedding is one of the most common building blocks in geometry processing algorithms due to its simplicity and provable guarantees. Although provably correct in infinite precision arithmetic, it fails in challenging cases when implemented using floating point arithmetic, largely due to the induced exponential area changes. We propose Progressive Embedding, with similar theoretical guarantees to Tutte embedding, but more resilient to the rounding error of floating point arithmetic. Inspired by progressive meshes, we collapse edges on an invalid embedding to a valid, simplified mesh, then insert points back while maintaining validity. We demonstrate the robustness of our method by computing embeddings for a large collection of disk topology meshes. By combining our robust embedding with a variant of the matchmaker algorithm, we propose a general algorithm for the problem of mapping multiply connected domains with arbitrary hard constraints to the plane, with applications in texture mapping and remeshing.

UR - http://www.scopus.com/inward/record.url?scp=85073888016&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85073888016&partnerID=8YFLogxK

U2 - 10.1145/3306346.3323012

DO - 10.1145/3306346.3323012

M3 - Article

AN - SCOPUS:85073888016

VL - 38

JO - ACM Transactions on Graphics

JF - ACM Transactions on Graphics

SN - 0730-0301

IS - 4

M1 - 32

ER -