The ATM Forum Technical Committee [1 citations — 0 self]

Download:

by Without Delaunay Triangulation, Hai Zhou, Narendra Shenoy, William Nicholls

UNI 4.0 Security Addendum, ATM Forum BTD-SIG-SEC

http://www.cs.utexas.edu/users/haizhou/aspdac01.ps

Add To MetaCart

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@INPROCEEDINGS{Triangulation_theatm,
    author = {Without Delaunay Triangulation and Hai Zhou and Narendra Shenoy and William Nicholls},
    title = {The ATM Forum Technical Committee},
    booktitle = {UNI 4.0 Security Addendum, ATM Forum BTD-SIG-SEC},
    year = {},
    pages = {192--197}
}

Abstract:

Minimum spanning tree problem is a very important problem in VLSI CAD. Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs of points and takes at least \Omega\Gamma

Citations

5825	Introduction to Algorithms – Cormen, Leiserson, et al. - 2001
245	A sweepline algorithm for Voronoi diagrams – Fortune - 1987
227	Combinatorial Optimization: Networks and – Lawler - 1976
212	Skip lists: A probabilistic alternative to balanced trees – Pugh - 1990
154	Priority search trees – McCreight - 1985
139	On constructing minimum spanning trees in k-dimensional space and related problems – Yao - 1982
96	Preparata and Michael Ian Shamos. Computational Geometry: An Introduction – Franco - 1985
21	Low-degree minimum spanning trees – Robins, Salowe - 1995
16	An O(n logn) algorithm for rectilinear minimal spanning trees – HWANG - 1979
15	1996]: Finding Obstacle-Avoiding Shortest Paths Using Implicit Connection Graphs – Zheng, Lim, et al. - 1996
13	On computing all ' north-east nearest neighbors – Guibas, Stolfi - 1983
4	An O(n log n) plane-sweep algorithm for L1 and L∞ delaunay triangulations – Shute, Deneen, et al. - 1991
2	An O(n log n) plane-sweep algorithm for L 1 and L1 Delaunay triangulations, Algorithmica 6(2 – Shute, Deneen, et al. - 1991

View or Download | Add to My Collection | Correct Errors