Monique Teillaud  Home/Search
Context Related
| inria.fr/INRIA/publicat...RR1727.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: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Computational geometry aims to design and analyze algorithms for solving geometric problems. It is a recent field of theoretical computer science, that rapidly developed since it appeared in M.I. Shamos' thesis in 1978. Randomization allows to avoid the use of complicated data structures, and has been proved to be very efficient, from both points of view of theoretical complexity and practical results. We take particular interest in designing dynamic algorithms: in practice, the data of a... (Update)
Context of citations to this paper: More
...us to perform splits and unions of trapezoidal maps. 3. 1 The Influence Graph for trapezoidal maps The Influence graph [BDS 92, Tei93] is based on the idea of maintaining the history of the construction by an incremental algorithm [BT86] It allows semi dynamic...
...are the changes in the Delaunay triangulation. These events are ruled by the Delaunay triangulation empty circumcircle criterion (see [Teill93a] and Fig. 3) Fig. 3: The Delaunay triangulation empty circumcircle criterion When a point comes inside a circumcircle or goes out...
Cited by: More
Bivariate Simplex B-Splines: A New Paradigm - Neamtu (2001) (Correct)
What is the Natural Generalization of Univariate Splines to.. - Neamtu (Correct)
Visualizing changes in a dynamic Voronoi data structure via.. - Mioc, Anton, Gold (Correct)
Similar documents (at the sentence level): More
77.8%: Towards Dynamic Randomized Algorithms in Computational Geometry - Teillaud (1992) (Correct)
10.2%: A Semi-Dynamic Construction of Higher Order Voronoi.. - Boissonnat.. (1993) (Correct)
9.8%: Applications of Random Sampling to On-line.. - Boissonnat.. (1992) (Correct)
Active bibliography (related documents): More All
0.3: On The Randomized Construction Of The Delaunay Tree - Boissonnat, Teillaud (1991) (Correct)
0.1: Median Hyperplanes in Normed Spaces - Martini, Schöbel (Correct)
0.1: Steiner Minimal Trees: An Introduction, Parallel Computation.. - Harris, Jr. (1998) (Correct)
Similar documents based on text: More All
0.9: Classification of Some Homogeneous and Ultrahomogeneous Structures - Devillers (Correct)
0.9: Developpement d'un verifieur de bytecode JavaCard optimise pour.. - Deville (2001) (Correct)
0.5: Robust and efficient implementation of the Delaunay tree - Devillers (1992) (Correct)
Related documents from co-citation: More All
5: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams (context) - Okabe, Boots et al. - 1992
3: Spline functions: basic theory (context) - Schumaker - 1981
3: Sur la sphere vide (context) - Delaunay - 1934
BibTeX entry: (Update)
Teillaud, M., 1993, Towards Dynamic Randomized Algorithms in Computational Geometry, Lecture Notes in Computer Science 758, (Berlin: Springer-Verlag). http://citeseer.ist.psu.edu/article/teillaud92towards.html More
@book{ teillaud93towards,
author = "Monique Teillaud",
title = "Towards dynamic randomized algorithms in computational geometry",
volume = "758",
publisher = "Springer-Verlag Inc.",
address = "New York, NY, USA",
isbn = "3-540-57503-0 (Berlin), 0-387-57503-0 (New York)",
pages = "ix + 156",
year = "1993",
url = "citeseer.ist.psu.edu/article/teillaud92towards.html" }
Citations (may not include all citations):95 Linear programming and convex hulls made easy (context) - Seidel - 1990
94 Closest-point problems (context) - Shamos, Hoey - 1975
56 Constructing higher-dimensional convex hulls at logarithmic .. (context) - Seidel - 1986
55 Design and implementation of an efficient priority queue (context) - Boas, Kaas et al. - 1977
55 Backwards analysis of randomized geometric algorithms - Seidel - 1991
34 Constructing the visibility graph for n line segments in O (context) - Welzl - 1985
29 A simple and fast randomized algorithm for computing trapezo.. (context) - Seidel - 1991
26 Dynamic maintenance of geometric structures made easy (context) - Schwarzkopf - 1991
10 Department of Computer Science (context) - Shamos, PhD - 1978
4 A convex hull algorithm optimal for point sites in even dime.. (context) - Seidel - 1981
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (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