Simplification of cross-field topology
Daniele Panozzo, Enrico Puppo
TL;DR
This paper introduces a novel algorithm for simplifying the topology of cross-fields by editing their separatrix graphs through macro-operations, ensuring topological consistency.
Contribution
The paper presents an innovative algorithm that simplifies cross-field topology via macro-operations on separatrix graphs, maintaining topological integrity.
Findings
Preliminary implementation results demonstrate effectiveness.
Algorithm preserves topological consistency during simplification.
Potential applications in geometric modeling and visualization.
Abstract
We present an innovative algorithm that simplifies the topology of a cross-field. Our algorithm works through macro-operations that allow us editing the graph of separatrices, which is extracted from a cross-field, while maintaining it topologically consistent. We present preliminary results of our implementation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Data Management and Algorithms · Distributed and Parallel Computing Systems