Avoiding the global sort: a faster contour tree algorithm (Q1688860): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2215070680
@@ Property / OpenAlex ID: W2215070680 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2689
@@ Property / arXiv ID: 1411.2689 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for computing Reeb graphs
@@ Property / cites work: Efficient algorithms for computing Reeb graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing contour trees in all dimensions
@@ Property / cites work: Computing contour trees in all dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+Simple and optimal output-sensitive construction of contour trees using monotone paths
+Normal rank
@@ Property / cites work @@
+Loops in reeb graphs of 2-manifolds
@@ Property / cites work: Loops in reeb graphs of 2-manifolds / rank @@
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3655278
@@ Property / cites work: Q3655278 / rank @@
+Normal rank
@@ Property / cites work @@
+A randomized             <i>O</i>             (             <i>m</i>             log             <i>m</i>             ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
+Normal rank
@@ Property / cites work @@
+A deterministic             <i>o(m log m)</i>             time algorithm for the reeb graph
+Normal rank
@@ Property / cites work @@
+Q4953184
@@ Property / cites work: Q4953184 / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for manipulating priority queues
@@ Property / cites work: A data structure for manipulating priority queues / rank @@
+Normal rank