Zoekresultaten
Resultaat 1 - 20 (van 27)
J. Vleugels | Mark H. Overmars Approximating generalized Voronoi diagrams in any dimension
Non-fictie
Engels | 4 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1995
Gedrukt boek
D. Halperin | Mark H. Overmars Spheres, molecules, and hidden surface removal
Non-fictie
Engels | 21 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1994
Gedrukt boek
Mark H. Overmars | A.F. van der Stappen Range searching and point location among fat objects
Non-fictie
Engels | 22 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1994
Gedrukt boek
Jean-Marc Robert | Leonidas Guibas | Mark H. Overmars The exact fitting problem in higher dimensions
Non-fictie
Engels | 17 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
Mark H. Overmars Point location in fat subdivisions
Non-fictie
Engels | 7 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1991
Gedrukt boek
Marc J. van Kreveld | Mark H. Overmars Concatenable structures for decomposable problems
Non-fictie
Engels | 19 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1989
Gedrukt boek
Mark H. Overmars | Chee-Keng Yap New upper bounds in Klee's measure problem
Non-fictie
Engels | 16 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1989
Gedrukt boek
Haijo Schipper | Mark H. Overmars Dynamic partition trees
Non-fictie
Engels | 18 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1989
Gedrukt boek
Micha Sharir | Mark H. Overmars An improved technique for output-sensitive hidden surface removal
Non-fictie
Engels | 19 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1989
Gedrukt boek
Herbert Edelsbrunner | Mark H. Overmars | Emo Welzl Ranking intervals under visibility constraints
Non-fictie
Engels | 15 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1989
Gedrukt boek
Mark de Berg | Mark H. Overmars | Marc J. van Kreveld Finding complete bipartite subgraphs in bipartite graphs
Non-fictie
Engels | 7 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1989
Gedrukt boek
Mark H. Overmars | Haijo Schipper | Micha Sharir Storing line segments in partition trees
Non-fictie
Engels | 20 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1989
Gedrukt boek
Mark H. Overmars | Chee-Keng Yap New upper bounds in Klee's measure problem
(extended abstract)
Non-fictie
Engels | 10 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Marc J. van Kreveld | Mark H. Overmars Concatenable segment trees
Non-fictie
Engels | 27 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Marc J. van Kreveld | Mark H. Overmars Divided k-d trees
Non-fictie
Engels | 18 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Mark H. Overmars Connectability problems
Non-fictie
Engels | 9 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Mark H. Overmars | Emo Welzl New methods for computing visibility graphs
extended abstract
Non-fictie
Engels | 8 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
David P. Dobkin | Herbert Edelsbrunner | Mark H. Overmars Searching for empty convex polygons
Non-fictie
Engels | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Mark H. Overmars | B. Scholten | Ingrid Vincent Sets without empty convex 6-gons
Non-fictie
Engels | 9 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Leonidas Guibas | Mark H. Overmars | Micha Sharir Intersecting line segments, ray shooting and other applications of geometric partitioning techniques
Non-fictie
Engels | 12 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek