The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Otfried Schwarzkopf: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jirí Matousek, Otfried Schwarzkopf
    Linear Optimization Queries. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:16-25 [Conf]
  2. Chantal Wentink, Otfried Schwarzkopf
    Motion Planning for Vacuum Cleaner Robots. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:51-56 [Conf]
  3. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:67-75 [Conf]
  4. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl
    Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:203-210 [Conf]
  5. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
    Computing Many Faces in Arrangements of Lines and Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:76-84 [Conf]
  6. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir
    The Overlay of Lower Envelopes in Three Dimensions and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:182-189 [Conf]
  7. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an Object from its Cast. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:221-230 [Conf]
  8. Helmut Alt, Otfried Schwarzkopf
    The Voronoi Diagram of Curved Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:89-97 [Conf]
  9. Franz Aurenhammer, Otfried Schwarzkopf
    A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:142-151 [Conf]
  10. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
    Computing and Verifying Depth Orders. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:138-145 [Conf]
  11. Mark H. Overmars, Anil S. Rao, Otfried Schwarzkopf, Chantal Wentink
    Immobilizing Polygons against a Wall. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:29-38 [Conf]
  12. Otfried Schwarzkopf
    Ray Shooting in Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:286-295 [Conf]
  13. Otfried Schwarzkopf
    The Extensible Drawing Editor Ipe. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  14. Otfried Schwarzkopf, Micha Sharir
    Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:20-29 [Conf]
  15. Otfried Schwarzkopf
    Dynamic Maintenance of Geometric Structures Made Easy [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:197-206 [Conf]
  16. Otfried Schwarzkopf
    Computing Convolutions on Mesh-Like Structures. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:695-699 [Conf]
  17. Mark de Berg, Olivier Devillers, Marc J. van Kreveld, Otfried Schwarzkopf, Monique Teillaud
    Computing the Maximum Overlap of Two Convex Polygons Under Translations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:126-135 [Conf]
  18. Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:1-10 [Conf]
  19. Alon Efrat, Otfried Schwarzkopf
    Separating and Shattering Long Line Segments. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:36-44 [Conf]
  20. Otfried Schwarzkopf
    Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:193-204 [Conf]
  21. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
    Approximation of Convex Figures by Pairs of Rectangles. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:240-249 [Conf]
  22. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf
    On lazy randomized incremental construction. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:105-114 [Conf]
  23. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Piecewise linear paths among convex obstacles. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:505-514 [Conf]
  24. Jirí Matousek, Otfried Schwarzkopf
    A deterministic algorithm for the three-dimensional diameter problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:478-484 [Conf]
  25. Otfried Schwarzkopf
    Parallel Computation of Disease Transforms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:5, pp:685-697 [Journal]
  26. Otfried Schwarzkopf
    Parallel Computation of Distance Transforms - Erratum. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:337- [Journal]
  27. Hee-Kap Ahn, Mark de Berg, Prosenjit Bose, Siu-Wing Cheng, Dan Halperin, Jirí Matousek, Otfried Schwarzkopf
    Separating an object from its cast. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 2002, v:34, n:8, pp:547-559 [Journal]
  28. Mark de Berg, Marc J. van Kreveld, Otfried Schwarzkopf, Jack Snoeyink
    Point Location in Zones of K-flats in Arrangements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:131-143 [Journal]
  29. Jirí Matousek, Otfried Schwarzkopf
    A Deterministic Algorithm for the Three-dimensional Diameter Problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:253-262 [Journal]
  30. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
    Approximation of convex figures by pairs of rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:2, pp:77-87 [Journal]
  31. Martin Aigner, Otfried Schwarzkopf
    Bounds on the Size of Merging Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:61, n:3, pp:187-194 [Journal]
  32. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf
    Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:407-422 [Journal]
  33. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir
    The Overlay of Lower Envelopes and Its Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:1, pp:1-13 [Journal]
  34. Mark de Berg, Katrin Dobrindt, Otfried Schwarzkopf
    On Lazy Randomized Incremental Construction. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:3, pp:261-286 [Journal]
  35. Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Piecewise Linear Paths Among Convex Obstacles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:1, pp:9-29 [Journal]
  36. Jirí Matousek, Otfried Schwarzkopf
    On Ray Shooting in Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:215-232 [Journal]
  37. Otfried Schwarzkopf, Micha Sharir
    Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:3, pp:269-288 [Journal]
  38. Mark de Berg, Otfried Schwarzkopf
    Cuttings and applications. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:4, pp:343-355 [Journal]
  39. Franz Aurenhammer, Otfried Schwarzkopf
    A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:4, pp:363-381 [Journal]
  40. Mark de Berg, Olivier Devillers, Katrin Dobrindt, Otfried Schwarzkopf
    Computing a Single Cell in the Overlay of Two Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:4, pp:215-219 [Journal]
  41. Alon Efrat, Otfried Schwarzkopf
    Separating and Shattering Long Line Segments. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:6, pp:309-314 [Journal]
  42. Otfried Schwarzkopf, Jules Vleugels
    Range Searching in Low-Density Environments. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:60, n:3, pp:121-127 [Journal]
  43. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:654-667 [Journal]
  44. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
    Computing Many Faces in Arrangements of Lines and Segments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:491-505 [Journal]
  45. Mark de Berg, Mark H. Overmars, Otfried Schwarzkopf
    Computing and Verifying Depth Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:2, pp:437-446 [Journal]
  46. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:140, n:2, pp:301-317 [Journal]

Search in 0.025secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002