What does this research mean for the field?

The proposed Steiner Traversal Initialization (STI) and Poisson Traversal Initialization (PTI) algorithms accelerate geometric flow-based surface-filling curve generation by over 30-fold, with PTI maintaining high robustness even on poorly tessellated meshes. Novelty: ClaimNovelty.METHODOLOGICAL. Consensus alignment: ConsensusAlignment.NEUTRAL.

What question did this study set out to answer?

This research aims to improve curve initialization techniques for 3D surface filling, addressing performance issues in geometric flow algorithms.

June 8, 2026IEEE Computer Graphics and Applications

Steiner and Poisson Traversal Initializations: Initial Curve Optimization for Geometric Flow-based Surface Filling

View Full Paper

Ask AI

Bookmark

Authors

FHFuma Hidaka YMYusuke Matsui

Discussion

Member takes

Overview

Randomized trial compares curve initialization techniques for 3D surface filling, highlighting speed and robustness implications.

Key Points

This research aims to improve curve initialization techniques for 3D surface filling, addressing performance issues in geometric flow algorithms.
Proposed two algorithms: Steiner Traversal Initialization (STI) and Poisson Traversal Initialization (PTI).
STI uses an approximate minimum Steiner tree on the dual graph, and PTI utilizes geodesic Poisson disk sampling for tree construction.
Conducted extensive experiments to evaluate performance on varying mesh quality.
STI accelerates curve generation by up to 37.14× on high-quality meshes but degrades on poorly shaped meshes.
PTI achieves a speedup of up to 32.63×, maintaining performance on poorly tessellated meshes with sliver triangles.

Cite This Study

Hidaka et al. (2026) studied this question.

synapsesocial.com/papers/6a265becad53cfb9357c53f1 https://doi.org/10.1109/mcg.2026.3700842

View Full Paper

Ask AI

Bookmark

June 8, 2026IEEE Computer Graphics and Applications

Steiner and Poisson Traversal Initializations: Initial Curve Optimization for Geometric Flow-based Surface Filling

View Full Paper

Ask AI

Bookmark

Authors

FHFuma Hidaka YMYusuke Matsui

Discussion

Member takes

Overview

Randomized trial compares curve initialization techniques for 3D surface filling, highlighting speed and robustness implications.

Key Points

This research aims to improve curve initialization techniques for 3D surface filling, addressing performance issues in geometric flow algorithms.
Proposed two algorithms: Steiner Traversal Initialization (STI) and Poisson Traversal Initialization (PTI).
STI uses an approximate minimum Steiner tree on the dual graph, and PTI utilizes geodesic Poisson disk sampling for tree construction.
Conducted extensive experiments to evaluate performance on varying mesh quality.
STI accelerates curve generation by up to 37.14× on high-quality meshes but degrades on poorly shaped meshes.
PTI achieves a speedup of up to 32.63×, maintaining performance on poorly tessellated meshes with sliver triangles.

Cite This Study

Hidaka et al. (2026) studied this question.

synapsesocial.com/papers/6a265becad53cfb9357c53f1 https://doi.org/10.1109/mcg.2026.3700842

View Full Paper

Ask AI

Bookmark