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

Leman Feng

dblp:222/2615 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021

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
2 papers
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
mesh processing
0.512021
Q-zip: singularity editing primitive for quad meshes · ACM Trans. Graph. 2021
Geometric modeling and processing › mesh generation
delaunay triangulation
0.312018
Curved optimal delaunay triangulation · ACM Trans. Graph. 2018
Geometric modeling and processing › mesh generation
mesh curving
0.312018
Curved optimal delaunay triangulation · ACM Trans. Graph. 2018
Geometric modeling and processing
mesh generation
0.312018
Curved optimal delaunay triangulation · ACM Trans. Graph. 2018

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

parallel transport · 0.5local topological operations · 0.5optimal delaunay triangulation · 0.3jacobian optimization · 0.3continuum mechanics interpretation · 0.3
YearPublicationVenuePosition
2021 Q-zip: singularity editing primitive for quad meshes
abstract
Singularity editing of a quadrangle mesh consists in shifting singularities around for either improving the quality of the mesh elements or canceling extraneous singularities, so as to increase mesh regularity. However, the particular structure of a quad mesh renders the exploration of allowable connectivity changes non-local and hard to automate. In this paper, we introduce a simple, principled, and general quad-mesh editing primitive with which pairs of arbitrarily distant singularities can be efficiently displaced around a mesh through a deterministic and reversible chain of local topological operations with a minimal footprint. Dubbed Q-zip as it acts as a zipper opening up and collapsing down quad strips, our practical mesh operator for singularity editing can be easily implemented via parallel transport of a reference compass between any two irregular vertices. Batches of Q-zips performed in parallel can then be used for efficient singularity editing.
Leman Feng, Yiying Tong, Mathieu Desbrun
ACM Trans. Graph.1
2018 Curved optimal delaunay triangulation
abstract
Meshes with curvilinear elements hold the appealing promise of enhanced geometric flexibility and higher-order numerical accuracy compared to their commonly-used straight-edge counterparts. However, the generation of curved meshes remains a computationally expensive endeavor with current meshing approaches: high-order parametric elements are notoriously difficult to conform to a given boundary geometry, and enforcing a smooth and non-degenerate Jacobian everywhere brings additional numerical difficulties to the meshing of complex domains. In this paper, we propose an extension of Optimal Delaunay Triangulations (ODT) to curved and graded isotropic meshes. By exploiting a continuum mechanics interpretation of ODT instead of the usual approximation theoretical foundations, we formulate a very robust geometry and topology optimization of Bézier meshes based on a new simple functional promoting isotropic and uniform Jacobians throughout the domain. We demonstrate that our resulting curved meshes can adapt to complex domains with high precision even for a small count of elements thanks to the added flexibility afforded by more control points and higher order basis functions.
Leman Feng, Pierre Alliez, Laurent Busé, Hervé Delingette, Mathieu Desbrun
ACM Trans. Graph.1