Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Arul Asirvatham

dblp:70/2016 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › shape correspondence
inter-surface mapping
0.012004
Inter-surface mapping · ACM Trans. Graph. 2004
Geometric modeling and processing
surface mapping
0.012004
Inter-surface mapping · ACM Trans. Graph. 2004
Geometric modeling and processing
surface parameterization
0.012004
Inter-surface mapping · ACM Trans. Graph. 2004

Methods — techniques the papers use, named apart from their topics

symmetric distortion metric · 0.0coarse-to-fine refinement · 0.0
YearPublicationVenuePosition
2004 Inter-surface mapping
abstract
We consider the problem of creating a map between two arbitrary triangle meshes. Whereas previous approaches compose parametrizations over a simpler intermediate domain, we directly create and optimize a continuous map between the meshes. Map distortion is measured with a new symmetric metric, and is minimized during interleaved coarse-to-fine refinement of both meshes. By explicitly favoring low inter-surface distortion, we obtain maps that naturally align corresponding shape elements. Typically, the user need only specify a handful of feature correspondences for initial registration, and even these constraints can be removed during optimization. Our method robustly satisfies hard constraints if desired. Inter-surface mapping is shown using geometric and attribute morphs. Our general framework can also be applied to parametrize surfaces onto simplicial domains, such as coarse meshes (for semi-regular remeshing), and octahedron and toroidal domains (for geometry image remeshing). In these settings, we obtain better parametrizations than with previous specialized techniques, thanks to our fine-grain optimization.
John Schreiner, Arul Asirvatham, Emil Praun, Hugues Hoppe
ACM Trans. Graph.2