S. V. Rao  Home/Search
Context
Related
| cse.iitk.ac.in/research/p...svrao.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cse.iitk.ac.in/research/p...svrao (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: a -skeleton for any 0. The time-complexity of our algorithm is in O(n log n), for 2 [0; 1) under the metric L p for 1 < p < 1. In the metrics L 1 and L1 , our algorithm takes O(n log n) time for any 0. iii and additively weighted -skeletons. We have shown that the above sweepline method can be extended to construct these geometric graphs too. The time complexity of computing the k -skeleton is in O(kn n) for 1 and in log n+n k) for in the range [0, 1). The ... (Update)
Similar documents based on text: More All
0.1: No organization without obligations: How to formalize.. - Royakkers, Dignum (2000) (Correct)
0.1: Eye Controlled Media: Present and Future State - Glenstrup, Engell-Nielsen (1995) (Correct)
0.1: Efficient Enumeration of Extensions of Local Fields with Bounded.. - Pauli (2001) (Correct)
BibTeX entry: (Update)
@misc{ rao-some,
author = "S. V. Rao",
title = "Some Studies on Beta-Skeletons",
url = "citeseer.ist.psu.edu/rao98some.html" }
Citations (may not include all citations):1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
396 Pattern classi cation and scene analysis (context) - Duda, Hart - 1973
193 Solid Shape (context) - Koenderink - 1990
165 Three-dimensional alpha shapes - Edelsbrunner, Mucke - 1994
159 A sweepline algorithm for voronoi diagrams (context) - Fortune - 1987
114 Optimal point location in a monotone subdivision (context) - Edelsbrunner, Guibas et al. - 1986
98 volume 10 of EATCS Monographs on Theoretical Computer Scienc.. (context) - Edelsbrunner, Combinatorial - 1987
69 Filtering search: A new approach to query-answering (context) - Chazelle - 1986
65 A framework for computational morphology (context) - Kirkpatrick, Radke - 1985
57 Relative neighborhood graphs and their relatives - Jaromczyk, Toussaint - 1992
52 Shape reconstruction from planar cross-sections (context) - Boissonnat - 1988
48 regular shape reconstruction from unorganized points (context) - Attali - 1998
45 Multidimensional searching problems (context) - Dobkin, Lipton - 1976
42 algorithm for the all nearest neighbors problem (context) - Vaidya, log - 1989
41 the shape of a set of points in the plane (context) - Edelsbrunner, Kirpatrick et al. - 1983
[Article contains additional citations not shown here]
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC