Your search returned the following 39 documents:

39. Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
    Michiel Smid, Rahul Ray, Ulrich Wendt, and Katharina Lange
    Discrete Applied Mathematics 139 (1-3): 253-264, 2004
    
38. Computing Large Planar Regions in Terrains
    Rahul Ray, MIchiel Smid, Katharina Lange, and Ulrich Wendt
    In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), Philadelphia, USA, 2002, 139-152
    [PS: Download: iwcia01.ps]
    
37. Surface Topography Quantification by Integral and Feature-related Parameters
    Ulrich Wendt, Katharina Lange, Michiel Smid, Rahul Ray, and Klaus-Dietz Tönnies
    Materialwissenschaft und Werkstofftechnik 33 (10): 621-627, 2002
    
36. Translating a Planar Object to Maximize Point Containment
    Pankaj Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel Smid, and Emo Welzl
    In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002, 42-53
    
35. Surface Topography Quantification using Computational Geometry
    Ulrich Wendt, Katharina Lange, Rahul Ray, and Michiel Smid
    Poster presentation
    
34. Efficient algorithms for counting and reporting pairwise intersections between convex polygons
    Prosenjit Gupta, Ravi Janardan, and Michiel Smid
    Information Processing Letters 69 (1): 7-13, 1999
    
33. Randomized Data Structures for the Dynamic Closest-Pair Problem
    Mordecai J. Golin, Rajeev Raman, Christian Schwarz, and Michiel Smid
    SIAM Journal on Computing 27 (4): 1036-1072, 1998
    
32. Computing the largest empty anchored cylinder, and related problems
    Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel Smid, and Christian Thiel
    International Journal of Computational Geometry and Applications 7 (6): 563-580, 1997
    
31. Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
    Jörg Schwerdt, Michiel Smid, and Stefan Schirra
    In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), Nice, France, June, 4 - June, 6, 1997, 466-468
    
30. Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
    Jörg Schwerdt, Michiel Smid, and Stefan Schirra
    In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), Nice, France, June, 4 - June, 6, 1997, 466-468
    
29. Efficient construction of a bounded degree spanner with low weight
    Sunil Arya and Michiel Smid
    Algorithmica 17 (1): 33-54, 1997
    
28. More efficient parallel totally monotone matrix searching
    Phillip Gnassi Bradford, Rudolf Fleischer, and Michiel Smid
    Journal of Algorithms 23: 386-400, 1997
    
27. On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
    Gautam Das, Sanjiv Kapoor, and Michiel Smid
    Algorithmica 19: 447-460, 1997
    
26. The rectangle enclosure and point-dominance problems revisited
    Prosenjit Gupta, Ravi Janardan, Michiel Smid, and Bhaskar Dasgupta
    International Journal of Computational Geometry and Applications 7 (5): 437-456, 1997
    
25. Algorithms for generalized halfspace range searching and other intersection searching problems
    Prosenjit Gupta, Ravi Janardan, and Michiel Smid
    Computational Geometry 5 (6): 321-340, 1996
    
24. Algorithms for generalized halfspace range searching and other intersection searching problems
    Prosenjit Gupta, Ravi Janardan, and Michiel Smid
    Computational Geometry 6 (1): 1-19, 1996
    
23. Fast algorithms for collision and proximity problems involving moving geometric objects
    Prosenjit Gupta, Ravi Janardan, and Michiel Smid
    Computational Geometry 6: 371-391, 1996
    
22. Lower bounds for computing geometric spanners and approximate shortest paths
    Danny Z. Chen, Gautam Das, and Michiel Smid
    In: 8th Canadian Conference on Computing, Ottawa, Canada, 1996, 155-160
    
21. New techniques for exact and approximate dynamic closest-point problems
    Sanjiv Kapoor and Michiel Smid
    SIAM Journal on Computing 25 (4): 775-796, 1996
    
20. On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
    Gautam Das, Sanjiv Kapoor, and Michiel Smid
    In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, Hyderabad, India, December, 18-20, 1996, 64-75
    
19. Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
    Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel Smid, and Christos Zaroliagis
    In: Algorithms - ESA '96: 4th Annual European Symposium, Barcelona, September, 25th-27th, 1996, 514-528
    
18. Computing a largest empty anchored cylinder, and related problems
    Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel Smid, and Christian Thiel
    In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, Bangalore, India, December, 18th - 20th, 1995, 428-442
    
17. Dynamic rectangular point location, with an application to the closest pair problem
    Michiel Smid
    Information and Computation 16 (1): 1-9, 1995
    
16. Euclidean spanners: short, thin, and lanky
    Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, and Michiel Smid
    In: 27th Annual ACM Symposium on Theory of Computing (STOC95), Las Vegas, Nevada, USA, May, 29th - June, 1st, 1995, 489-498
    
15. Further results on generalized intersection searching problems: counting, reporting, and dynamization
    Prosenjit Gupta, Ravi Janardan, and Michiel Smid
    Journal of Algorithms 19 (2): 282-317, 1995
    
14. Maintaining the visibility map of spheres while moving the viewpoint
    Hans-Peter Lenhof and Michiel Smid
    Algorithmica 13 (3): 301-312, 1995
    
13. On the width and roundness of a set of points in the plane
    Ravi Janardan and Michiel Smid
    In: 7th Canadian Conference on Computational Geometry, 1995, 193-198
    
12. Sequential and parallel algorithms for the k closest pairs problem
    Hans-Peter Lenhof and Michiel Smid
    International Journal of Computational Geometry & Applications 5 (3): 273-288, 1995
    
11. Simple randomized algorithms for closest pair problems
    Mordecai J. Golin, Rajeev Raman, Christian Schwarz, and Michiel Smid
    Nordic Journal of Computing 2: 3-27, 1995
    
10. Static and dynamic algorithms for k-point clustering problems
    Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, and Michiel Smid
    Journal of Algorithms 19 (3): 474-503, 1995
    
9. The rectangle enclosure and point-dominance problems revisited
   Prosenjit Gupta, Ravi Janardan, and Michiel Smid
   In: 11th Annual !CM Symposium on Computational Geometry, Vancouver, British Columbia, Canada, June, 5th - 7th, 1995, 162-171
   
8. The rectangle enclosure and point-dominance problems revisited
   Prosenjit Gupta, Ravi Janardan, Michiel Smid, and Bhaskar Dasgupta
   In: 11th Annual ACM Symposium on Computing Geometry, 1995, 162-171
   
7. An animation of a fixed-radius all-nearest neighbors algorithm
   Hans-Peter Lenhof and Michiel Smid
   In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), Stony Brook, New York, USA, June, 6th - 8th, 1994, 387 p.
   
6. Using persistent data structures for adding range restrictions to searching problems
   Hans-Peter Lenhof and Michiel Smid
   RAIRO Theoretical Informatics and Applications 28: 25-49, 1994
   
5. An optimal construction method for generalized convex layers
   Hans-Peter Lenhof and Michiel Smid
   International Journal of Computational Geometry & Applications 3 (3): 245-267, 1993
   
4. Enumerating the k closest pairs optimally
   Hans-Peter Lenhof and Michiel Smid
   In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), Pittsburgh, Pennsylvania, USA, October, 24th - 27th, 1992, 380-386
   
3. Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
   Hans-Peter Lenhof and Michiel Smid
   In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July, 8th - 10th, 1992, 388-398
   
2. Dynamic deferred data structuring
   Yu-Tai Ching, Kurt Mehlhorn, and Michiel H. M. Smid
   Information Processing Letters 35 (1): 37-40, 1990
   
1. An optimal construction method for generalized convex layers
   Hans-Peter Lenhof and Michiel Smid
   In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, Taipei, Republic of China, December, 16th - 18th, 1991, 349-363