Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time (Englisch)
- Neue Suche nach: Fischer, Matthias
- Neue Suche nach: Lukovszki, Tamás
- Neue Suche nach: Ziegler, Martin
- Neue Suche nach: Bilardi, Gianfranco
- Neue Suche nach: Italiano, Giuseppe F.
- Neue Suche nach: Pietracaprina, Andrea
- Neue Suche nach: Pucci, Geppino
- Neue Suche nach: Fischer, Matthias
- Neue Suche nach: Lukovszki, Tamás
- Neue Suche nach: Ziegler, Martin
In:
Algorithms — ESA’ 98
: 6th Annual European Symposium Venice, Italy, August 24–26, 1998 Proceedings
;
Kapitel: 14
;
163-174
;
2002
-
ISSN:
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
-
Beteiligte:Bilardi, Gianfranco ( Herausgeber:in ) / Italiano, Giuseppe F. ( Herausgeber:in ) / Pietracaprina, Andrea ( Herausgeber:in ) / Pucci, Geppino ( Herausgeber:in ) / Fischer, Matthias ( Autor:in ) / Lukovszki, Tamás ( Autor:in ) / Ziegler, Martin ( Autor:in )
-
Kongress:European Symposium on Algorithms ; 1998 ; Venice, Italy
-
Erschienen in:Algorithms — ESA’ 98 : 6th Annual European Symposium Venice, Italy, August 24–26, 1998 Proceedings ; Kapitel: 14 ; 163-174Lecture Notes in Computer Science ; 1461 ; 163-174
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
-
Erscheinungsort:Berlin, Heidelberg
-
Erscheinungsdatum:15.03.2002
-
Format / Umfang:12 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
External Memory AlgorithmsVitter, Jeffrey Scott et al. | 2002
- 2
-
Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper)Upfal, Eli et al. | 2002
- 3
-
Car-Pooling as a Data Structuring Device: The Soft HeapChazelle, Bernard et al. | 2002
- 4
-
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge PropertyBradford, Phil / Golin, Mordecai J. / Larmore, Lawrence L. / Rytter, Wojciech et al. | 2002
- 5
-
Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge FailuresNardelli, Enrico / Proietti, Guido / Widmayer, Peter et al. | 2002
- 6
-
Augmenting Suffix Trees, with ApplicationsMatias, Yossi / Muthukrishnan, S. / Sahinalp, Süleyman Cenk / Ziv, Jacob et al. | 2002
- 7
-
Longest Common Subsequence from Fragments via Sparse Dynamic ProgrammingBaker, Brenda S. / Giancarlo, Raffaele et al. | 2002
- 8
-
Computing the Edit-Distance Between Unrooted Ordered TreesKlein, Philip N. et al. | 2002
- 9
-
Analogs and Duals of the MAST Problem for Sequences and TreesFellows, Michael / Hallett, Michael / Korostensky, Chantal / Stege, Ulrike et al. | 2002
- 10
-
Complexity Estimates Depending on Condition and Round-Off ErrorCucker, Felipe / Smale, Steve et al. | 2002
- 11
-
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root CountingRojas, J. Maurice et al. | 2002
- 12
-
Fast Algorithms for Linear Algebra Modulo NStorjohann, Arne / Mulders, Thom et al. | 2002
- 13
-
A Probabilistic Zero-Test for Expressions Involving Roots of Rational NumbersBlömer, Johannes et al. | 2002
- 14
-
Geometric Searching in Walkthrough Animations with Weak Spanners in Real TimeFischer, Matthias / Lukovszki, Tamás / Ziegler, Martin et al. | 2002
- 15
-
A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)d’Amore, Fabrizio / Franciosa, Paolo G. / Liotta, Giuseppe et al. | 2002
- 16
-
Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability ResultEidenbenz, Stephan / Stamm, Christoph / Widmayer, Peter et al. | 2002
- 17
-
Two-Center Problems for a Convex Polygon (Extended Abstract)Shin, Chan-Su / Kim, Jung-Hyun / Kim, Sung Kwon / Chwa, Kyung-Yong et al. | 2002
- 18
-
Constructing Binary Space Partitions for Orthogonal Rectangles in PracticeMurali, T. M. / Agarwal, Pankaj K. / Vitter, Jeffrey Scott et al. | 2002
- 19
-
A Fast Random Greedy Algorithm for the Component Commonality ProblemKannan, Ravi / Nolte, Andreas et al. | 2002
- 20
-
Maximizing Job Completions OnlineKalyanasundaram, Bala / Pruhs, Kirk et al. | 2002
- 21
-
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)Bartal, Yair / Chrobak, Marek / Larmore, Lawrence L. et al. | 2002
- 22
-
On Nonblocking Properties of the Beneš NetworkKolman, Petr et al. | 2002
- 23
-
Adaptability and the Usefulness of Hints (Extended Abstract)Berman, Piotr / Garay, Juan A. et al. | 2002
- 24
-
Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract)Kranakis, Evangelos / Krizanc, Danny / Pelc, Andrzej et al. | 2002
- 25
-
New Bounds for Oblivious Mesh RoutingIwama, Kazuo / Kambayashi, Yahiko / Miyano, Eiji et al. | 2002
- 26
-
Evaluating Server-Assisted Cache Replacement in the WebCohen, Edith / Krishnamurthy, Balachander / Rexford, Jennifer et al. | 2002
- 27
-
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc WeightsFrigioni, D. / Marchetti-Spaccamela, A. / Nanni, U. et al. | 2002
- 28
-
A Functional Approach to External Graph AlgorithmsAbello, James / Buchsbaum, Adam L. / Westbrook, Jeffery R. et al. | 2002
- 29
-
Minimal Triangulations for Graphs with “Few” Minimal SeparatorsBouchitté, Vincent / Todinca, Ioan et al. | 2002
- 30
-
Finding an Optimal Path without Growing the TreeChen, Danny Z. / Daescu, Ovidiu / Hu, Xiaobo (Sharon) / Xu, Jinhui et al. | 2002
- 31
-
An Experimental Study of Dynamic Algorithms for Directed GraphsFrigioni, Daniele / Miller, Tobias / Nanni, Umberto / Pasqualone, Giulio / Schaefer, Guido / Zaroliagis, Christos et al. | 2002
- 32
-
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known ThemeIrving, Robert W. et al. | 2002
- 33
-
Δ-Stepping : A Parallel Single Source Shortest Path AlgorithmMeyer, Ulrich / Sanders, Peter et al. | 2002
- 34
-
Improved Deterministic Parallel Padded SortingChong, Ka Wong / Ramos, Edgar A. et al. | 2002
- 35
-
Analyzing an Infinite Parallel Job Allocation ProcessAdler, Micah / Berenbrink, Petra / Schröder, Klaus et al. | 2002
- 36
-
Nearest Neighbor Load Balancing on GraphsDiekmann, Ralf / Frommer, Andreas / Monien, Burkhard et al. | 2002
- 37
-
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of LeavesSolis-Oba, Roberto et al. | 2002
- 38
-
Moving-Target TSP and Related ProblemsHelvig, C. S. / Robins, Gabriel / Zelikovsky, Alex et al. | 2002
- 39
-
Fitting Points on the Real Line and Its Application to RH MappingHåstad, Johan / Ivansson, Lars / Lagergren, Jens et al. | 2002
- 40
-
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)Krivelevich, Michael / Sudakov, Benny et al. | 2002
- 41
-
Techniques for Scheduling with RejectionEngels, Daniel W. / Karger, David R. / Kolliopoulos, Stavros G. / Sengupta, Sudipta / Uma, R. N. / Wein, Joel et al. | 2002
- 42
-
Computer-Aided Way to Prove Theorems in SchedulingSevastianov, S. V. / Tchernykh, I. D. et al. | 2002