Tamás Lukovszki  Home/Search
Context Related
| wwwhni.unipaderborn.de/...thesis.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: unipaderborn.de/fachberei...Luko (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents 1 Introduction 1 1.1 Walkthrough systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Geometric spanners and weak spanners . . . . . . . . . . . . . . . . . . 3 1.3 Fault tolerant spanners . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.4 Computational model . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.5 Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2 The `-graph 9 2.1 The two-dimensional `-graph . . . . . . ... (Update)
Context of citations to this paper: More
...that the length stretch factor of RNG(V ) is at most n 1 and the length stretch factor of GG(V ) is at most 4# # 2n 4 . Several papers [31], 32] 27] showed that the Yao graph YG k (V ) has length stretch factor at most 1 2sin . However, the Yao graph is not guaranteed to be...
Cited by: More
Fault-Tolerant Geometric Spanners - Artur Czumaj Czumaj (Correct)
Using Dominating Sets To Improve The Performance Of Mobile Ad Hoc.. - Spohn (2005) (Correct)
Fault Tolerant Deployment and Topology Control in Wireless.. - Li, Wan, Wang, Yi (2003) (Correct)
Active bibliography (related documents): More All
1.3: Geometric Searching in Walkthrough Animations with Weak .. - Fischer, Lukovszki.. (1998) (Correct)
1.2: New Results on Fault Tolerant Geometric Spanners - Lukovszki (1999) (Correct)
0.9: Partitioned Neighborhood Spanners of Minimal Outdegree - Fischer, Lukovszki, Ziegler (1999) (Correct)
Similar documents based on text: More All
0.5: Bounded Degree Spanning Trees - Strothmann (Correct)
0.2: Bi-directional Coupling of Simulation Tools a with .. - Mueck.. (2002) (Correct)
0.2: Parallel Algorithmic Techniques: PRAM Algorithms And PRAM.. - Czumaj (1995) (Correct)
Related documents from co-citation: More All
8: Ad-hoc on-demand distance vector routing - Perkins - 1997
7: Routing with guaranteed delivery in ad hoc wireless networks - Bose, Morin et al. - 1999
7: On constructing minimum spanning trees in k-dimensional spaces and related probl.. (context) - Yao - 1982
BibTeX entry: (Update)
Tamas Lukovszki, New Results on Geometric Spanners and Their Applications, Ph.D. thesis, University of Paderborn, 1999. http://citeseer.ist.psu.edu/article/lukovszki99new.html More
@inproceedings{ lukovszki99new,
author = "Tamas Lukovszki",
title = "New Results of Fault Tolerant Geometric Spanners",
booktitle = "Workshop on Algorithms and Data Structures",
pages = "193-204",
year = "1999",
url = "citeseer.ist.psu.edu/article/lukovszki99new.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1254 Computational Geometry An Introduction (context) - Preparata, Shamos - 1985
837 Cambridge University Press (context) - Motwani, Raghavan - 1995
666 The design and Analysis of Spatial Data Structures (context) - Samet - 1990
335 Application of random sampling in computational geometry -- .. - Clarkson, Shor - 1989
266 An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1994
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1990
218 A separator theorem for planar graphs (context) - Lipton, Tarjan - 1979
193 Extremal Graph Theory (context) - Bollob'as - 1978
133 Geometric range searching and its relatives - Agarwal, Erickson - 1997
127 A linear-time algorithm for a special case of disjoint set u.. (context) - Gabow, Tarjan - 1985
124 Lower bounds for algebraic computation trees (context) - Ben-Or - 1983
109 Provably good mesh generation - Bern, Eppstein et al. - 1994
106 Priority search trees (context) - McCreight - 1985
102 Dynamic perfect hashing: Upper and lower bounds - Dietzfelbinger, Karlin et al. - 1994
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
81 On range searching with semialgebraic sets - Agarwal, Matousek - 1994
74 On constructing minimum spanning trees in k-dimensional spac.. (context) - Yao - 1982
69 Surpassing the information theoretic bound with fusion trees (context) - Fredman, Willard - 1993
62 Classes of graphs which approximate the complete Euclidean g.. (context) - Keil, Gutwin - 1992
60 Decomposable searching problems I: Static-todynamic transfor.. (context) - Bentley, Saxe - 1980
60 Multi-Dimensional Searching and Computational Geometry (context) - Mehlhorn - 1984
55 Design and implementation of an efficient priority queue (context) - Boas, Kaas et al. - 1977
51 EATCS Monographs on Theoretical Computer Science (context) - Edelsbrunner, Combinatorial et al. - 1987
49 Euclidean spanners: Short (context) - Arya, Das et al. - 1995
49 Lower bounds for algebraic decision trees (context) - Steele, Yao - 1982
49 Dynamic fractional cascading (context) - Mehlhorn, Naher - 1990
46 Approximation algorithms for shortest path motion planning - Clarkson - 1987
45 New sparseness results on graph spanners - Chandra, Das et al. - 1995
42 algorithm for the all-nearest-neighbors problem (context) - Vaidya, log - 1989
40 Faster algorithms for some geometric graph problems in highe.. - Callahan, Kosaraju - 1993
40 Geometric range searching - Matousek - 1991
39 A data structure for orthogonal range queries (context) - Lueker - 1978
36 A general approach to d-dimensional geometric queries (context) - Yao, Yao - 1985
33 an Introduction through Randomized Algorithms (context) - Mulmuley - 1994
31 Closest-Point Problems in Computational Geometry - Smid - 1998
31 dimensional complete Euclidean graph (context) - Ruppert, Seidel et al. - 1991
29 nearest neighbor Voronoi diagrams in the plane (context) - Lee - 1982
26 the complexity of computations under varying sets of primiti.. (context) - Dobkin, Lipton - 1979
26 A simpler minimum spanning tree verification algorithm - King - 1997
24 Constructing multidimensional spanner graphs (context) - Salowe - 1991
24 Parallel construction of quadtrees and quality triangulation.. - Bern, Eppstein et al. - 1993
24 A sparse graph almost as good as the complete graph on point.. (context) - Vaidya - 1991
23 There is a planar graph almost as good as the complete graph (context) - Chew - 1986
21 A polynomial-time approximation scheme for weighted palnar g.. - Arora, Grigni et al. - 1998
20 Lower bounds for computing geometric spanners and approximat.. - Chen, Das et al. - 1996
19 Voronoi diagrams and arrangements (context) - Edelsbrunner, Seidel - 1986
16 dimensional Voronoi diagrams (context) - Klee, complexity - 1980
16 Dihedral bounds for mesh generation in high dimensions - Bern, Chew et al. - 1995
15 New upper bounds for neighbor searching (context) - Chazelle, Cole et al. - 1986
15 Covering a sphere with spheres (context) - Rogers - 1963
14 Proving simultaneous positivity of linear forms (context) - Rabin - 1972
13 Dealing with Higher Dimensions: The Well-Separated Pair Deco.. - Callahan - 1995
13 Randomized and deterministic algorithms for geometric spanne.. - Arya, Mount et al. - 1994
11 New results on fault tolerant geometric spanners - Lukovszki - 1999
10 Computational Geometry: Theory and Applications (context) - Matousek, in - 1992
10 Approximating the complete Euclidean graph (context) - Keil - 1988
10 Constructing degree-3 spanners with other sparseness propert.. (context) - Das, Heffernan - 1996
9 Geometric searching in walkthrough animations with weak span.. - Fischer, Lukovszki et al. - 1998
8 A robust region approach to the computation of geometric gra.. (context) - d'Amore, Franciosa et al. - 1998
8 Dynamic data structures for realtime management of large geo.. - Fischer, auf et al. - 1997
7 Dynamic graph algorithms - Eppstein, Galil et al. - 1997
7 Dynamic hashing in real time (context) - Dietzfelbinger, auf - 1992
7 A simple and relatively efficient triangulation of the n-cub.. (context) - Haiman - 1991
7 Improved approximation schemes for geometrical graphs via `s.. - Rao, Smith - 1998
6 On intersection searching problems involving curved objects (context) - Gupta, Janardan et al. - 1994
6 A note on the euclidean near neighbor searching in the plane (context) - Bentley, Maurer - 1979
6 Partitioned neighborhood spanners of minimal outdegree - Fischer, Lukovszki et al. - 1999
5 Efficient algorithms for constructing fault-tolerant geometr.. - Levcopoulos, Narasimhan et al. - 1998
5 the optimality of some set algorithms (context) - Reingold - 1972
3 A decompostion of multidimensional point sets with applicati.. (context) - Callahan, Kosaraju - 1995
3 A network based approach for realtime walkthrough of massive.. - Fischer, Lukovszki et al. - 1998
2 The middle-cut triangulations of the n-cube (context) - Sallee - 1984
2 Solving query-retrival problems by compact Voronoi diagrams (context) - Aggarwal, Hansen et al. - 1990
1 A criterion of affine equality of cell complexes in IR d and.. (context) - Aurenhammer - 1987
1 Fibonacci heaps and their uses in improved network algorithm.. (context) - Fredman, Tarjan - 1987
1 Lower Bounds for Fundamental Geometric Problems - Erickson - 1996
1 Voronoi diagrams -- a survey of a foundamental geometric dat.. (context) - Aurenhammer - 1991
1 Regular Triangulations of Convex Polytopes and n-Cubes (context) - Bigdeli - 1991
1 Walter de Gruyter (context) - Barner, Flohr - 1983
1 Lecture Notes in Economical and Mathematical Systems (context) - Todd, of et al. - 1976
1 Praktische Informatik VI (context) - Aurenhammer, Klein et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/english/Luko.html): More
A Network Based Approach for Realtime Walkthrough of.. - Fischer, Lukovszki.. (1998) (Correct)
Decremental Biconnectivity on Planar Graphs - Lukovszki, Strothman (1997) (Correct)
New Results on Fault Tolerant Geometric Spanners - Lukovszki (1999) (Correct)
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