SODA 2000 - PDF Preprint Papers

SODA 2000 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2000 Paper

click to vote

SODA
2000
ACM

148views Algorithms» more SODA 2000»

Computing contour trees in all dimensions

13 years 5 months ago

Download www.comp.leeds.ac.uk

We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...

Hamish Carr, Jack Snoeyink, Ulrike Axen

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	148	Computing contour trees in all dimensions	claim
2	137	Approximating the maximum quadratic assignment problem	claim
3	132	Expected-case complexity of approximate nearest neighbor searching	claim
4	127	Dimensionality reduction techniques for proximity problems	claim
5	125	Approximation algorithms for projective clustering	claim
6	123	Communication complexity of document exchange	claim
7	122	Cooperative facility location games	claim
8	121	Coloring powers of planar graphs	claim
9	120	Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks	claim
10	114	Typical random 3-SAT formulae and the satisfiability threshold	claim
11	114	The rectilinear Steiner arborescence problem is NP-complete	claim
12	111	A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry	claim
13	109	Approximate congruence in nearly linear time	claim
14	107	Competitive tree-structured dictionaries	claim
15	106	Algorithms for optimizing production DNA sequencing	claim
16	105	Efficient dynamic traitor tracing	claim
17	102	Escaping a grid by edge-disjoint paths	claim
18	99	Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling	claim
19	99	A point-placement strategy for conforming Delaunay tetrahedralization	claim
20	97	Efficient bundle sorting	claim
21	96	Improved Steiner tree approximation in graphs	claim
22	95	On external memory graph traversal	claim
23	95	Faster deterministic dictionaries	claim
24	95	Towards a theory of cache-efficient algorithms	claim
25	90	Evaluating the cylindricity of a nominally cylindrical point set	claim
26	85	Real scaled matching	claim
27	85	Improved bounds on the sample complexity of learning	claim
28	83	Restructuring ordered binary trees	claim
29	82	On the temporal HZY compression scheme	claim
30	78	Strengthening integrality gaps for capacitated network design and covering problems	claim
31	76	Scheduling to minimize average stretch without migration	claim
32	76	Applying extra-resource analysis to load balancing	claim
33	58	Engineering the compression of massive tables: an experimental approach	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers