Karamouzas, I. & Overmars, M. (2010). A Velocity-Based Approach for Simulating Human Collision Avoidance. In J..M. Allbeck, N..I. Badler, T..W. Bickmore, C. Pelachaud & A. Safonova (Eds.), 10th International Conference on Intelligent Virtual Agents, IVA 2010 Vol. 6356. Lecture Notes in Computer Science (pp. 180-186). Berlin: Springer.
|
Karamouzas, I. & Overmars, M. (2010). Simulating Human Collision Avoidance Using a Velocity-Based Approach. In J. Bender, M. Teschner & K. Erleben (Eds.), Seventh Workshop on Virtual Reality Interaction and Physical Simulation, VRIPHYS 2010 (pp. 125-134). Eurographics Association.
|
Karamouzas, I. & Overmars, M. (2010). Simulating the Local Behaviour of Small Pedestrian Groups. In G. Baciu, R..W..H. Lau, M. Lin, T. Komura & Q. Peng (Eds.), 17th ACM Symposium on Virtual Reality Software and Technology, VRST 2010 (pp. 183-190). ACM.
|
Welbergen, H. van, Basten, B.J.H. van, Egges, A., Ruttkay, Zs. & Overmars, M.H. (2010). Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control. In Vol. 29. Computer Graphics Forum (pp. 2530-2554). Blackwell Publishing Ltd.
|
Karamouzas, I., Heil, P. & Overmars, M.H. (2010). Simulating the Walking Behaviour of Small Groups in Virtual Crowds. In SCA'10: Poster Proc. ACM SIGGRAPH/Eurographics Symposium on Computer Animation (pp. 11-12).
|
Karamouzas, I., Heil, P., Beek, P. van & Overmars, M.H. (2009). A Predictive Collision Avoidance Model for Pedestrian Simulation. In A. Egges, R. Geraerts & M.H. Overmars (Eds.), MIG '09: Proceedings of the 2nd International Workshop on Motion in Games (pp. 41-52). Springer-Verlag.
|
Karamouzas, I., Bakker, J. & Overmars, M.H. (2009). Density constraints for crowd simulation. In Games Innovations Conference, 2009. ICE-GIC 2009. International IEEE Consumer Electronics Society's (pp. 160-168).
|
Karamouzas, I., Geraerts, R.J. & Overmars, M.H. (2009). Indicative Routes for Path Planning and Crowd Simulation. In J. Whitehead & R.M. Young (Eds.), The Fourth International Conference on the Foundations of Digital Games (pp. 113-120). ACM.
|
Egges, A., Geraerts, R.J. & Overmars, M.H. (Eds.). (2009). Motion in Games, Second International Workshop, MIG 2009 (Lecture Notes in Computer Science, 5884). Heidelberg: Springer.
|
Overmars, M.H. (2009). Path Planning in Utrecht. In Fascination for Computation, 25 jaar Informatica (pp. 89-102).
|
Welbergen, H. van, Basten, B.J.H. van, Egges, J., Ruttkay, Zs. & Overmars, M.H. (2009). Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control. In Mark Pauly & Guenther Greiner (Eds.), Eurographics 2009 - State of the Art Reports (pp. 45-72). Munich, Germany: Eurographics Association.
|
Egges, J., Kamphuis, A. & Overmars, M.H. (Eds.). (2009). Special Issue on Gaming (20:50-6). Computer Animation and Virtual Worlds: Wiley.
|
Karamouzas, I. & Overmars, M.H. (2008). Adding variation to path planning. Computer Animation and Virtual Worlds, 19, 283-293.
|
Nieuwenhuisen, D., Stappen, A.F. van der & Overmars, M.H. (2008). An effective framework for path planning amidst movable obstacles. In S. Akella, N.M Amato, W.H. Huang & B Mishra (Eds.), Algorithmic Foundations of Robotics VII (pp. 87-102). Berlin Heidelberg: Springer Verlag.
|
Berg, M.T. de, Cheong, O., Kreveld, M.J. van & Overmars, M.H. (2008). Computational Geometry -- Algorithms and Aplications (3rd). Berlin: Springer-Verlag.
|
Geraerts, R.J. & Overmars, M.H. (2008). Enhancing Corridor Maps for Real-Time Path Planning in Virtual Environments. In J. Noh, K. Wohn & G.J. Kim (Eds.), Computer Animation and Social Agents (pp. 64-71).
|
Overmars, M.H., Karamouzas, I. & Geraerts, R.J. (2008). Flexible Path Planning Using Corridor Maps. In D. Halperin & K. Mehlhorn (Eds.), Algorithms -- ESA (pp. 1-12). Springer.
|
Egges, J. & Overmars, M.H. (2008). Motion in Games. Berlin: Springer-Verlag.
|
Kamphuis, A. & Overmars, M.H. (2008). Path planning using corridors and its applications. In Proc. 2008 IEEE Virtual Reality Workshop on Virtual Cityscapes.
|
Berg, Jur van den & Overmars, M.H. (2008). Planning time-minimal safe path amidst unpredictably moving obstacles. The international journal of robotics research, 27(11-12), 1274-1294.
|
Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M.H. & Whitesides, S. (2008). Realizing partitions respecting full and partial order information. Journal of Discrete Algorithms, 6, 51-58.
|
Geraerts, R.J., Kamphuis, A., Karamouzas, I. & Overmars, M.H. (2008). Using the Corridor Map Method for Path Planning for a Large Number of Characters. In A. Egges, A. Kamphuis & M.H. Overmars (Eds.), Motion in Games (MIG'08) Vol. 5277. Lecture Notes in Computer Science (pp. 11-22). Springer.
|
Berg, M.T. de, Halperin, D. & Overmars, M.H. (2007). An intersection-sensitive algorithm for snap rounding. Computational Geometry: Theory and Applications, 36, 159-165.
|
Agarwal, P.K., Overmars, M.H. & Sharir, M. (2006). Computing maximally separated sets in the plane. SIAM Journal on Computing, 36, 815-834.
|
Geraerts, R.J. & Overmars, M.H. (2007). Creating High-Quality Paths for Motion Planning. International Journal of Robotics Research, 26, 845-863.
|
Nieuwenhuisen, D., Berg, J.P. van den & Overmars, M.H. (2007). Efficient path planning in changing environments. In Proceedings IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'07), (pp. 3295-3301). ieee.
|
Nieuwenhuisen, D., Kamphuis, A. & Overmars, M.H. (2007). High quality navigation in computer games. Science of Computer Programming, 67, 91-104.
|
Kamphuis, A., Sonnemans, N. & Overmars, M.H. (2007). Kinematic path generation in games. In Proceedings CASA 2007 (pp. 27-34).
|
Berg, J.P. van den & Overmars, M.H. (2007). Kinodynamic motion planning on roadmaps in dynamic environments. In Proceedings IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'07) (pp. 4253-4258). ieee.
|
Nieuwenhuisen, D., Stappen, A.F. van der & Overmars, M.H. (2007). Pushing a disk using compliance. IEEE robotics & automation magazine, 23, 431-442.
|
Geraerts, R.J. & Overmars, M.H. (2007). Reachability-based Analysis for Probabilistic Roadmap Planners. Robotics and Autonomous Systems, 55, 824-836.
|
Geraerts, R.J. & Overmars, M.H. (2007). The Corridor Map Method: A General Framework for Real-Time High-Quality Path Planning. Computer Animation and Virtual Worlds, 18, 107-119.
|
Geraerts, R.J. & Overmars, M.H. (2007). The Corridor Map Method: Real-Time High-Quality Path Planning. In Proceedings of the IEEE International Conference on Robotics and Automation.
|
Nieuwenhuisen, D., Stappen, A.F. van der & Overmars, M.H. (2006). An Effective Framework for Path Planning amidst Movable Obstacles. UU-CS 2006-035. onbekend: UU WINFI Informatica en Informatiekunde.
|
Berg, J.P. van den & Overmars, M.H. (2006). Computing shortest paths amidst growing discs in the plane. In Proceedings European Workshop on Computational Geometry (pp. 59-62).
|
Geraerts, R.J. & Overmars, M.H. (2006). Creating High-quality Roadmaps for Motion Planning in Virtual Environments. In IEEE/RSJ International Conference on Intelligent Robots and Systems (pp. 4355-4361).
|
Nieuwenhuisen, D., Stappen, A.F. van der & Overmars, M.H. (2006). Path planning among movable obstacles. In .
|
Berg, J.P. van den & Overmars, M.H. (2006). Path planning in repetitive environments. In Proceedings IEEE Int. Conf. on Methods and Models in Automation and Robotics (MMAR'06) (pp. 657-662).
|
Berg, J.P. van den & Overmars, M.H. (2006). Planning the shortest safe path amidst unpredictably moving obstacles. In Proceedings Workshop on Algorithmic Foundations of Robotics (WAFR 2006).
|
Nieuwenhuisen, D., Stappen, A.F. van der & Overmars, M.H. (2006). Pushing using Compliance. UU-CS 2006-036. onbekend: UU WINFI Informatica en Informatiekunde.
|
Nieuwenhuisen, D., Stappen, A.F. van der & Overmars, M.H. (2006). Pushing using compliance. In Proceedings of the IEEE International Conference on Robotics and Automation. (pp. 2010-2016). IEEE.
|
Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M.H. & Whitesides, S. (2006). Realizing partitions respecting full and partial order information. In J. Ryan, P. Manyem, K. Sugeng & M. Miller (Eds.), Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (pp. 105-113).
|
Geraerts, R.J. & Overmars, M.H. (2006). Sampling and Node Adding in Probabilistic Roadmap Planners. Robotics and Autonomous Systems, 54, 165-173.
|
Erdman, M., Hsu, D., Overmars, M.H. & Stappen, A.F. van der (Eds.). (2005). Algorithmic Foundations of Robotics VI (Springer Tracts in Advanced Robotics, 17). Berlin-Heidelberg: Springer-Verlag.
|
Nieuwenhuisen, D., Kamphuis, A., Mooijekind, M. & Overmars, M.H. (2005). Automatic Construction of Roadmaps for Path Planning in Games. In Proceedings Advanced School for Computing and Imaging Conference (pp. 153-163). Delft: ASCI.
|
Overmars, M.H. (2005). Computergame meer dan alleen een spelletje. De automatisering gids, 15.
|
Berg, J.P. van den, Nieuwenhuisen, D., Jaillet, J. & Overmars, M.H. (2005). Creating robust roadmaps for motion planning in changing environments. In IEEE/RSJ International Conference on Intelligent Robots and Systems (pp. 2415-2421).
|
Geraerts, R.J. & Overmars, M.H. (2005). Creating small roadmaps for solving motion planning problems. In Proc. 11th IEEE International Conference on Methods and Models in Automation and Robotics (pp. 531-536).
|
Overmars, M.H. (2005). Game research at Utrecht University. BNVKI newsletter, 22, 105-106.
|
Overmars, M.H. (2005). Gesimuleerde karakters grootste opgave. De automatisering gids, 46, 15.
|
Overmars, M.H. (2005). Leven van de handel in virtuele zwaarden. De automatisering gids, 47, 13.
|
Geraerts, R.J. & Overmars, M.H. (2005). On Improving the Clearance for Robots in High-Dimensional Configuration Spaces. UU-CS 2005-024. onbekend: UU WINFI Informatica en Informatiekunde.
|
Geraerts, R.J. & Overmars, M.H. (2005). On improving the clearance for robots in high-dimensional configuration spaces. In IEEE/RSJ International Conference on Intelligent Robots and Systems (pp. 4075-4079).
|
Geraerts, R.J. & Overmars, M.H. (2005). On the Analysis and Success of Sampling Based Motion Planning. In Conference of the Advanced School for Computing and Imaging (pp. 313-319).
|
Kamphuis, A., Pettre, J., Overmars, M.H. & Laumond, J.P. (2005). Path finding for the animation of walking characters. In Poster Proceedings Eurographics/ACM Symposium on Computer Animation (pp. 8-9). New York: The Association for Computing Machinery, Inc..
|
Overmars, M.H. (2005). Path planning for games. In Proceedings Third International Game Design and Technology Workshop and Conference (pp. 29-33). Liverpool: Liverpool John Moores University.
|
Nieuwenhuisen, D., Stappen, A.F. van der & Overmars, M.H. (2005). Path planning for pushing a disk using compliance. In IEEE/RSJ International Conference on Intelligent Robots and Systems (pp. 4061-4067).
|
Berg, J.P. van den & Overmars, M.H. (2005). Prioritized motion planning for multiple robots. In IEEE/RSJ International Conference on Intelligent Robots and Systems (pp. 2217-2222).
|
Merabti, M., Lee, N., Overmars, M.H. & El Rhalibi, A. (Eds.). (2005). Proceedings Third International Game Design and Technology Workshop and Conference. Liverpool: Liverpool John Moores University.
|
Geraerts, R.J. & Overmars, M.H. (2005). Reachability analysis of sampling based planners. In Proceedings of the IEEE International Conference on Robotics and Automation (pp. 406-412).
|
Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M.H. & Whitesides, S. (2005). Realizing partitions respecting full and partial order information. UU-CS 2005-037. onbekend: UU WINFI Informatica en Informatiekunde.
|
Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M.H. & Whitesides, S. (2005). Realizing partitions respecting full and partial order information. In J. Ryan, P. Manyem, K. Sugeng & M. Miller (Eds.), Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (pp. 105-113).
|
Berg, J.P. van den & Overmars, M.H. (2005). Roadmap-based motion planning in dynamic environments. IEEE transactions on robotics and automation, 21, 885-897.
|
Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Overmars, M.H. & Whitesides, S. (2005). Separating point sets in polygonal environments. International journal of computational geometry & applications, 403-419.
|
Erdmann, M., Hsu, D., Overmars, M.H. & Stappen, A.F. van der (Eds.). (2005). Special Issue on WAFR 2004 - International Journal of Robotics Research (24, 11). London: SAGE publishers.
|
Kamphuis, A., Rook, M. & Overmars, M.H. (2005). Tactical Path Finding in Urban Environments. In Proceedings First International Workshop on Crowd Simulation (pp. 51-60). Lausanne: VRLab, EPFL.
|
Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2005). The TSP with neighborhoods of varying size. Journal of Algorithms, 57, 22-36.
|
Berg, J.P. van den & Overmars, M.H. (2005). Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. The international journal of robotics research, 24, 1055-1071.
|
Berg, M.T. de, Halperin, D. & Overmars, M.H. (2004). An Intersection-Sensitive Algorithm for Snap Routing. UU-CS 2004-055. Utrecht: Utrecht University: Information and Computing Sciences.
|
Nieuwenhuisen, D., Kamphuis, A., Mooijekind, M. & Overmars, M.H. (2004). Automatic Construction of High Quality Roadmaps for Path Planning. UU-CS 2004-68. Utrecht: Utrecht University: Information and Computing Sciences.
|
Goemans, O.C. & Overmars, M.H. (2004). Automatic Generation of Camera Motion to Track a Moving Guide. UU-CS 2004-033. Utrecht: Utrecht University: Information and Computing Sciences.
|
Nieuwenhuisen, D., Kamphuis, A., Mooijekind, M. & Overmars, M.H. (2004). Automatic construction of roadmaps for path planning in games. In Proceedings CGAIDE 2004: 5th Game-On International Conference (pp. 285-292).
|
Goemans, O.C. & Overmars, M.H. (2004). Automatic generation of camera motion to track a moving guide. In Proceedings WAFR 2004 (pp. 201-216).
|
Geraerts, R.J. & Overmars, M.H. (2004). Clearance Based Path Optimization for Motion Planning. In IEEE Int. Conf. on Robotics and Automation (pp. 2386-2392).
|
Agarwal, P.K., Overmars, M.H. & Sharir, M. (2004). Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. In Proc. SODA 2004 (pp. 516-525).
|
Kamphuis, A. & Overmars, M.H. (2004). Finding Paths for Coherent Groups using Clearance. UU-CS 2004-62. Utrecht: Utrecht University: Information and Computing Sciences.
|
Kamphuis, A. & Overmars, M.H. (2004). Finding paths for coherent groups using clearance. In Proceedings ACM/Eurographics Symposium on Computer Animation. (pp. 19-28).
|
Overmars, M.H. (2004). Game Design in Education. UU-CS 2004-056. Utrecht: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (2004). Game design in education. In Proceedings CGAIDE 2004: 5th Game-On International Conference. (pp. 14-18).
|
Cheong, J.S., Stappen, A.F. van der, Goldberg, K., Overmars, M.H. & Rimon, E. (2004). Immobilizing Hinged Polygons. UU-CS 2004-005. Utrecht: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (2004). Learning Object-Oriented Design by Creating Games. UU-CS 2004-057. Utrecht: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (2004). Learning object-oriented design by creating games. IEEE, 23(5), 11-13.
|
Nieuwenhuisen, D. & Overmars, M.H. (2004). Motion planning for camera movements. In Proceedings of the IEEE International Conference on Robotics and Automation. (pp. 3870-3876).
|
Kamphuis, A. & Overmars, M.H. (2004). Motion planning for coherent groups of entities. In Proceedings of the IEEE International Conference on Robotics and Automation. (pp. 3815-3822).
|
Overmars, M.H. (2004). Motion planning in virtual environments and games. ERCIM news, 57, 33-34.
|
Geraerts, R.J. & Overmars, M.H. (2004). On Improving the Path Quality for Motion Planning. In Conference of the Advanced School for Computing and Imaging (ASCI) (pp. 211-217).
|
Berg, J.P. van den & Overmars, M.H. (2004). Roadmap-based Motion Planning in Dynamic Environments. UU-CS 2004-020. Utrecht: Utrecht University: Information and Computing Sciences.
|
Berg, J.P. van den & Overmars, M.H. (2004). Roadmap-based motion planning in dynamic environments. In Proceedings IEEE/RSJ Int. Conf. on Intelligent Robots and Systems - IROS'04 (pp. 1598-1605).
|
Geraerts, R.J. & Overmars, M.H. (2004). Sampling Techniques for Probabilistic Roadmap Planners. In Conference on Intelligent Autonomous Systems (pp. 600-609).
|
Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Overmars, M.H. & Whitesides, S. (2004). Separating point sets in polygonal environments. In Proceedings ACM Symp. on Computation Geometry (pp. 10-16).
|
Overmars, M.H. (2004). Teaching computer science through game design. IEEE, 37(4), 81-83.
|
Nieuwenhuisen, D. & Overmars, M.H. (2004). Useful Cycles in Probabilistic Roadmap Graphs. UU-CS 2004-064. Utrecht: Utrecht University: Information and Computing Sciences.
|
Nieuwenhuisen, D. & Overmars, M.H. (2004). Useful cycles in probabilistic roadmap graphs. In Proceedings of the IEEE International Conference on Robotics and Automation. (pp. 446-452).
|
Berg, J.P. van den & Overmars, M.H. (2004). Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. In Proceedings of the IEEE International Conference on Robotics and Automation (pp. 453-460).
|
Geraerts, R.J. & Overmars, M.H. (2003). A comparative study of probabilistic roadmap planners. In J-D. Boissonnat, J. Burdick, K. Goldberg & S. Hutchinson (Eds.), Algorithmic Foundations of Robotics V. Berlijn: Springer-Verlag.
|
Overmars, M.H. (2003). Algorithms for motion and navigation in virtual environments and games. In J-D. Boissonnat, J. Burdick, K. Goldberg & S. Hutchinson (Eds.), Algorithmic Foundations of Robotics V. Berlijn: Springer-Verlag.
|
Geraerts, R.J. & Overmars, M.H. (2003). Clearance Based Path Optimization for Motion Planning. UU-CS 2003-039. Utrecht`: Utrecht University: Information and Computing Sciences.
|
Agarwal, P.K., Overmars, M.H. & Sharir, M. (2003). Computing Maximally Separated Sets in the Plane and Independent Sets in the Intersection Graph of Unit Disks. UU-CS 2003-035. Utrecht: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (2003). Finding sets of points without empty convex 6-gons. Discrete and Computational Geometry, 2003(29), 153-158.
|
Berg, M.T. de, David, H., Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (2003). Guarding scenes against invasive hypercubes. Computational Geometry: Theory and Applications, 2003(26), 99-117.
|
Nieuwenhuisen, D. & Overmars, M.H. (2002). Motion Planning for Camera Movements in Virtual Environments. UU-CS 2003-004. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Overmars, M.H. (2003). On R-trees with low query complexity. Computational Geometry: Theory and Applications, 2003(24), 179-195.
|
Soss, M., Ericksson, J. & Overmars, M.H. (2003). Preprocessing chains for fast dihedral rotations is hard or even impossible. Computational Geometry: Theory and Applications, 2003(26), 235-246.
|
Geraerts, R.J. & Overmars, M.H. (2003). Sampling Techniques for Probabilistic Roadmap Planners. UU-CS 2003-041. Utrecht: Utrecht University: Information and Computing Sciences.
|
Berg, J.P. van den & Overmars, M.H. (2003). Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners. UU-CS 2003-037. Utrecht: Utrecht University: Information and Computing Sciences.
|
Geraerts, R.J. & Overmars, M.H. (2002). A Comparative Study of Probabilistic Roadmap Planners. UU-CS 2002-041. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Geraerts, R.J. & Overmars, M.H. (2002). A Comparative Study of Probabilistic Roadmap Planners. In Proceedings Workshop on the Algorithmic Foundations of Robotics (WAFR).
|
Aloupis, G., Bose, P., Demaine, E.D., Langerman, S., Meijer, H., Overmars, M.H. & Toussaint, G.T. (2002). Computing Signed Permutations of Polygons. UU-CS 2002-033. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H., Goldberg, K., Chen, J., Halperin, D., Böhringer, K.F. & Zhuang, Y. (2002). Computing Tolerance Parameters for Fixturing and Feeding. UU-CS 2002-006. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aloupis, G., Bose, P., Demaine, E., Langerman, S., Meijer, H., Overmars, M.H. & Toussaint, G. (2002). Computing signed permutations of polygons. In Proceedings of the 14th Canadian Conference on Computational Geometry (pp. 68-71).
|
Chen, J., Goldberg, K., Overmars, M.H., Halperin, D., Bohringer, K. & Zhuang, Y. (2002). Computing tolerance parameters for fixturing and feeding. Assembly automation, 22, 163-172.
|
Cheong, J.S., Goldberg, K., Overmars, M.H. & Stappen, A.F. van der (2002). Fixturing hinged polygons. In Proceedings of the IEEE International Conference on Robotics and Automation (pp. 876-881). IEEE.
|
Aloupis, G., Demaine, E., Dujmovic, V., Erickson, J., Langerman, S., Meijer, H., Streinu, I., O'Rourke, J., Overmars, M.H., Soss, M. & Toussaint, G. (2002). Flat-state connectivity of linkages under dihedral motions. In Proceedings of the 13th Annual International Sympoium on Algorithms and Computation (pp. 369-380).
|
Aichholzer, O., Cortes, C., Demaine, E., Dujmovic, V., Erickson, J., Meijer, H., Overmars, M.H., Palop, B., Ramaswami, S. & Toussaint, G. (2002). Flipturning polygons. Discrete and Computational Geometry, 28, 231-254.
|
Stappen, A.F. van der, Berretty, R.P.M., Goldberg, K. & Overmars, M.H. (2002). Geometry and part feeding. In G. Hager, H.I. Christensen, H. Bunke & R. Klein (Eds.), Sensor-Based Intelligent Robots (LNCS, 2238) (pp. 259-281). Springer-Verlag.
|
Berg, M.T. de, Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (2002). Models and motion planning. Computational Geometry: Theory and Applications, 23, 53-68.
|
Overmars, M.H. (2002). Motion planning in virtual environments. In E. Deprettere, A. Bellum, J. Heijnsdijk & A.F. van der Stappen (Eds.), ASCI 2002 (pp. 15-21).
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (2002). Orienting polyhedral parts by pushing. Computational Geometry: Theory and Applications, 21, 21-38.
|
Soss, M., Erickson, J. & Overmars, M.H. (2002). Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible. UU-CS 2002-020. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (2002). Recent developments in motion planning. UU-CS 2002-004. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (2002). Recent developments in motion planning. In P. Sloot, C. Kenneth Tan, J. Dongarra & A. Hoekstra (Eds.), Computational Science (pp. 3-13). Springer-Verlag.
|
Agarwal, P.K., Berg, M.T. de, Har-Peled, S., Overmars, M.H., Sharir, M. & Vahrenholdt, J. (2002). Reporting intersecting pairs of convex polytopes in two and three dimensions. Computational Geometry: Theory and Applications, 23, 195-208.
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (2002). Sensorless orientation of 3D polyhedral parts. In Proceedings of the IEEE International Conference on Robotics and Automation (pp. 2016-2021). IEEE.
|
Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2002). TSP with Neighborhoods of Varying Size. UU-CS 2002-036. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Gudmundsson, J. G., Katz, M.J., Levcopoulos, C., Overmars, M.H. & Stappen, A.F. van der (2002). TSP with neighborhouds of varying size. In Proceedings10th European Symposium on Algorithms ( ESA 2002) (pp. 187-199).
|
Overmars, M.H. (2001). Finding sets of points without empty convex 6-gons. UU-CS 2001-07. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Boor, V., Overmars, M.H. & Stappen, A.F. van der (2001). Gaussian sampling for probabilistic roadmap planners. UU-CS 2001-36. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Stappen, A.F. van der, Berretty, R.P.M., Goldberg, K. & Overmars, M.H. (2001). Geometry and Part Feeding. UU-CS 2001-11. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (2001). It's all in the game. UU-CS 2001-37. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (2001). It's all in the game. TINFON, 10, 74-78.
|
Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O'Rourke, J., Overmars, M.H., Robbins, S., Streinu, I., Toussaint, G. & Whitesides, S. (2001). Locked and Unlocked Polygonal Chains in 3D. Discrete and Computational Geometry, 26, 283-287.
|
Sent, D. & Overmars, M.H. (2001). Motion Planning in Environments with Dangerzones. UU-CS 2001-06. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Sent, D. & Overmars, M.H. (2001). Motion Planning in Environments with Dangerzones. In Proceedings of the International Conference on Robotics and Automations (pp. 1488-1493). Seoul, Korea.
|
Berg, M.T. de, Gudmundsson, J. G., Hammar, M. & Overmars, M.H. (2001). On R-trees with low query complexity. UU-CS 2001-21. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berretty, R.P.M., Goldberg, K., Overmars, M.H. & Stappen, A.F. van der (2001). Orienting Parts by Inside-Out Pulling. In Proceedings IEEE International Conference on Robotics and Automation (pp. 1053-1058).
|
Zhang, M.T., Goldberg, K., Smith, G., Berretty, R.P.M. & Overmars, M.H. (2001). Pin Design for Part Feeding. Robotica, 19, 695-702.
|
Aichholzer, O., Demaine, E., Erickson, J., Hurtado, F., Overmars, M.H., Soss, M. & Toussaint, G. (2001). Reconfiguring Convex Polygons. Computational Geometry: Theory and Applications, 20, 85-95.
|
Agarwal, P.K., Berg, M.T. de, Har-Peled, S., Overmars, M.H., Sharir, M. & Vahrenhold, J. (2001). Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. In F. Dehne, J.R. Sack & R. Tamassia (Eds.), Proceedings WADS 2001 (pp. 122-134). Berlin, Germany: Springer-Verlag.
|
Berretty, R.P.M., Goldberg, K., Overmars, M.H. & Stappen, A.F. van der (2001). Trap Design for Vibratory Bowl Feeders. The international journal of robotics research, 20(11), 891-908.
|
Hagedoorn, M., Overmars, M.H. & Veltkamp, R.C. (2000). A New visibility partition for affine pattern matching. In Proc. Discrete Geometry for Computer Imagery conference, DGCI 2000. (pp. 358-370). Berlin: Springer-Verlag.
|
Hagedoorn, M., Overmars, M.H. & Veltkamp, R.C. (2000). A robust affine invariant similarity measure based on visibility. In Proceedings EURO-CG-2000: The 16th Eoropean Workshop on Computtational Geometry (pp. 112-116). Eilat.
|
Berg, M.T. de, Kreveld, M.J. van, Overmars, M.H. & Schwarzkopf, O. (2000). Computational Geometry: Algorithms and Applications (second edition). Heidelberg: Springer-Verlag.
|
Stappen, A.F. van der, Wentink, C.J. & Overmars, M.H. (2000). Computing immobilizing grasps of polygonal parts. The international journal of robotics research, 19, 467-479.
|
Aichholzer, O., CortSÿs, C., Demaine, E.D., Dujmovic, V., Erickson, J., Meijer, H.J.M., Overmars, M.H., Palop, B., Ramaswami, S. & Toussaint, G.T. (2000). Flipturning polygons. UU-CS 2000-31. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aichholzer, O., Cortès, C., Demaine, E., Dujmovic, V., Erickson, J., Meijer, H.J.M, Overmars, M.H., Palop, B., Ramaswami, S. & Toussaint, G. (2000). Flipturning polygons. In Proc. Japan Conference on Discrete and Computational Geometry 2000.
|
Stappen, A.F. van der, Goldberg, K. & Overmars, M.H. (2000). Geometric eccentricity and the complexity of manipulation plans. Algorithmica, 26, 494-514.
|
Berg, M.T. de, Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (2000). Guarding scenes against invasive hypercubes. UU-CS 2000-40. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (2000). Models and motion planning. UU-CS 2000-41. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (2000). Orienting polyhedral parts by pushing. In Proceedings of the 16th European Workshop on Computational Geometry (pp. 136-139).
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (2000). Orienting polyhedral parts by pushing. UU-CS 2000-21. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aichholzer, O., Demaine, E., Erickson, J., Hurtado, F., Overmars, M.H., Soss, M. & Toussaint, G.T. (2000). Reconfiguring convex polygons. UU-CS 2000-30. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aichholzer, O., Demaine, E., Erickson, J., Hurtado, F., Overmars, M.H., Soss, M. & Toussaint, G. (2000). Reconfiguring convex polygons. In Proceedings CCCG 2000 (pp. 17-20).
|
Zhang, T., Smith, G., Berretty, R.P.M., Overmars, M.H. & Goldberg, K. (2000). The toppling graph: designing pin sequences for part feeding. In Proceedings 2000 IEEE Intern. Conf. on Robotics and Automation (pp. 139-146).
|
Berretty, R.P.M., Goldberg, K., Overmars, M.H. & Stappen, A.F. van der (2000). Trap design for vibratory bowl feeders. UU-CS 2000-39. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Stappen, A.F. van der, Wentink, C.J. & Overmars, M.H. (1999). Computing form-closure configurations. In Proceedings of the IEEE International Conference on Robotics and Automation (pp. 1837-1842). Los Alamitos CA: IEEE Computer Society Press.
|
Overmars, M.H., Stappen, A.F. van der & Wentink, C.J. (1999). Computing immobilizing grasps of polygonal parts. UU-CS 1999-14. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Berretty, R.P.M., Goldberg, K., Overmars, M.H. & Stappen, A.F. van der (1999). Geometric algorithms for trap design. In Proceedings 15th ACM Symposium on Computational Geometry (pp. 95-104).
|
Berretty, R.P.M., Goldberg, K., Overmars, M.H. & Stappen, A.F. van der (1999). Geometric trap design for automatic part feeders. In Proceedings of the 1999 International Symposium on Robotics Research (pp. 139-144).
|
Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O'Rourke, J., Overmars, M.H., Robbins, S., Streinu, I., Toussaint, G. & Whitesides, S. (1999). Locked and unlocked polygonal chains in 3D. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 866-867).
|
Hagedoorn, M., Overmars, M.H. & Veltkamp, R.C. (1999). New visibility partitions with applications in affine pattern matching. UU-CS 1999-21. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (1999). Robots in het Informatica onderwijs. TINFON, 8, 138-143.
|
Boor, V., Overmars, M.H. & Stappen, A.F. van der (1999). The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. In Proceedings of the 1999 IEEE International Conference on Robotics & Automation (pp. 1018-1023).
|
Berretty, R.P.M., Goldberg, K., Cheung, L., Overmars, M.H., Smith, G. & Stappen, A.F. van der (1999). Trap design for vibratory bowl feeders. In Proceedings of the 1999 IEEE International Conference on Robotics and Automation (pp. 2558-2563).
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (1998). Algorithms for fence design. UU-CS 1998-06. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (1998). Algorithms for fence design. In L. Kavraki, P. Agarwal & M. Mason (Eds.), Robotics, the Algorithmic Perspective (pp. 279-295). Boston, U.S.A.: A.K. Peters.
|
Overmars, M.H. & Vleugels, J.M. (1998). Approximating voronoi diagrams of convex sites in any dimension. International journal of computational geometry & applications, 8, 201-221.
|
Berretty, R.P.M., Goldberg, K., Overmars, M.H. & Stappen, A.F. van der (1998). Computing fence design for orienting parts. Computational Geometry: Theory and Applications, 10, 249-262.
|
Berg, M.T. de, Meijer, H.J.M, Overmars, M.H. & Wilfong, G. (1998). Computing the angularity tolerance. International journal of computational geometry & applications, 8, 467-467.
|
Svestka, P. & Overmars, M.H. (1998). Coordinated path planning for multiple robots. Robotics and Autonomous Systems, 23.
|
Stappen, A.F. van der, Berretty, R.P.M. & Overmars, M.H. (1998). Dynamic motion planning in low obstacle density environments. Computational Geometry: Theory and Applications, 11, 157-173.
|
Overmars, M.H. (1998). Geometric algorithms for robotic manipulations. In Proceedings of ICALP'98 (pp. 116-117). Springer Verlag.
|
Berg, M.T. de, David, H., Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (1998). Guarding scenes against invasive hypercubes. In Proceedings of the 2nd Workshop on Algorithm Engineering.
|
Tangelder, J.W.H., Vergeest, J. & Overmars, M.H. (1998). Interference-free nc machining using spatial planning and minkowski operations. Computer-Aided Design, 30, 277-286.
|
Berg, M.T. de, Katz, M.J., Overmars, M.H., Stappen, A.F. van der & Vleugels, J.M. (1998). Models and motion planning. In Proceedings 6th Scandinavian Workshop Algorithm Theory (pp. 83-94). Springer Verlag.
|
Stappen, A.F. van der, Overmars, M.H., Berg, M.T. de & Vleugels, J.M. (1998). Motion planning in environments with low obstacle density. Discrete and Computational Geometry, 20, 561-587.
|
Sekhavat, S., Svestka, P., Laumond, J.P. & Overmars, M.H. (1998). Multilevel path planning for nonholonomic robots using semiholonomic subsystems. The international journal of robotics research, 17, 840-857.
|
Svestka, P. & Overmars, M.H. (1998). Probabilistic path planning. In J.P. Laumond (Ed.), Robot Motion Planning and Control (LNCIS, 229) (pp. 255-304). Springer Verlag.
|
Tangelder, J.W.H., Vergeest, J., Belt, H. van den & Overmars, M.H. (1998). Producing physical prototypes using a sculpturing robot. In Proceedings TMCE'98 (pp. 254-259).
|
Chen, J., Goldberg, K., Overmars, M.H., Halperin, D., Bohringer, K. & Zhuang, Y. (1998). Shape tolerance in feeding and fixturing. In L. Kavraki, P. Agarwal & M. Mason (Eds.), Robotics, the Algorithmic Perspective (pp. 297-311). Boston, U.S.A.: A.K. Peters.
|
Overmars, M.H. & Halperin, D. (1998). Spheres, molecules, and hidden surface removal. Computational Geometry: Theory and Applications, 11, 83-102.
|
Biedl, T., Demaine, E., Demaine, M., Lubiw, A., Overmars, M.H., O'Rourke, J., Robbins, S. & Whitesides, S. (1998). Unfolding orthoballs without overlap. In Proceedings of CCCG'98 (pp. 297-311).
|
Laumond, J.P. & Overmars, M.H. (1997). Algorithms for Robotic Motion and Manipulation. Boston, U.S.A.: A.K. Peters.
|
Wentink, C.J., Stappen, A.F. van der & Overmars, M.H. (1997). Algorithms for fixture design. In J.P. Laumond & M.H. Overmars (Eds.), Algorithms for Robotic Motion and Manipulation (pp. 321-346). Boston, U.S.A.: A.K. Peters.
|
Berg, M.T. de, Kreveld, M.J. van & Overmars, M.H. (1997). Computational Geometry: Algorithms and Applications. Heidelberg, Germany: Springer Verlag.
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (1997). Computing fence designs for orienting parts. UU-CS 1997-41. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (1997). Dynamic motion planning in low obstacle density environments. UU-CS 1997-20. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berretty, R.P.M., Overmars, M.H. & Stappen, A.F. van der (1997). Dynamic motion planning in low obstacle density environments. In Proceedings WADS'97 (pp. 3-16). Springer Verlag.
|
Asberg, B., Blanco, G., Bose, P., Garcia-Lopez, J., Overmars, M.H., Toussaint, G., Wilfong, G. & Zhu, D. (1997). Feasibility of design in stereolithography. Algorithmica, 19, 61-83.
|
Wentink, C.J., Stappen, A.F. van der & Overmars, M.H. (1997). Fixture design with edge-fixels. In R. Bolles, H. Bunke & H. Noltemeier (Eds.), Intelligent robots: Sensing modeling and planning (pp. 269-286). Singapore: World Scientific Publ. Co..
|
Tangelder, J.W.H., Vergeest, J. & Overmars, M.H. (1997). Freeform shape machining using Minkowski operations. In J.P. Laumond & M.H. Overmars (Eds.), Algorithms for Robotic Motion and Manipulation (pp. 301-310). Boston, U.S.A.: A.K. Peters.
|
Overmars, M.H. & Santoro, N. (1997). Improved bounds for electing a leader in a synchronous ring. Algorithmica, 18, 248-262.
|
Svestka, P. & Overmars, M.H. (1997). Motion Planning for car-like robots, a probabilistic learning approach. The international journal of robotics research, 6, 119-143.
|
Stappen, A.F. van der, Overmars, M.H., Berg, M.T. de & Vleugels, J.M. (1997). Motion planning in environments with low obstacle density. UU-CS 1997-19. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Vleugels, J.M., Kok, J. & Overmars, M.H. (1997). Motion planning with complete knowledge using a colored SOM. International journal of neural systems, 8, 613-628.
|
Sekhavat, S., Svestka, P., Laumond, J.P. & Overmars, M.H. (1997). Multi-level path planning for nonholonomic robots using semi-holonomic subsystems. In J.P. Laumond & M.H. Overmars (Eds.), Algorithms for Robotic Motion and Manipulation (pp. 79-96). Boston, U.S.A.: A.K. Peters.
|
Berg, M.T. de, Groot, M. de & Overmars, M.H. (1997). New results on binary space partitions in the plane. Computational Geometry: Theory and Applications, 8, 317-333.
|
Berretty, R.P.M., Goldberg, K., Overmars, M.H. & Stappen, A.F. van der (1997). On fence design and the complexity of push plans for orienting parts. In Proceedings 13th ACM Symposium on Computational Geometry (pp. 21-29).
|
Berg, M.T. de, Groot, M. de & Overmars, M.H. (1997). Perfect binary space partitions. Computational Geometry: Theory and Applications, 7, 81-91.
|
Berg, M.T. de, Kreveld, M.J. van, Oostrum, R.W. van & Overmars, M.H. (1997). Simple traversal of a subdivision without extra storage. International Journal of Geographical Information Science, 11, 359-373.
|
Berg, M.T. de, Halperin, D., Overmars, M.H. & Kreveld, M.J. van (1997). Sparse arrangements and the numbers of views of polyhedral scenes. International journal of computational geometry & applications, 7, 175-195.
|
Bose, P., Guibas, L.J., Lubiw, A., Overmars, M.H., Souvaine, D. & Urrutia, J. (1997). The floodlight problem. International journal of computational geometry & applications, 7, 153-163.
|
Stappen, A.F. van der, Overmars, M.H. & Wentink, C.J. (1996). Algorithms for fixture design. UU-CS 1996-38. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Tangelder, J.W.H. & Overmars, M.H. (1996). Computation of Voxel Maps Containing Tool Access Directions for Machining Free-form Shapes. UU-CS 1996-23. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Tangelder, J.W.H., Vergeest, J. & Overmars, M.H. (1996). Computation of voxel maps containing tool access directions for machining free-form shapes. In Proceedings of the Design for manufacturing Conference (pp. 255-265).
|
Berg, M.T. de, Meijer, H.J.M, Overmars, M.H. & Wilfong, G. (1996). Computing the angularity tolerance. In Proceedings of the 8th Canadian Conference on Computational Geometry (pp. 331-336). Ottawa, Canada: Carleton University Press.
|
Berg, M.T. de, Meijer, H. & Overmars, M.H. (1996). Computing the angularity tolerance. UU-CS 1996-25. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Svestka, P. & Overmars, M.H. (1996). Coordinated path planning for multiple robots. UU-CS 1996-43. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Overmars, M.H. (1996). Designing the computational geometry algorithms library CGAL. In Applied Computational Geometry (LNCS, 1148) (pp. 53-56). Springer Verlag.
|
Tangelder, J.W.H. & Overmars, M.H. (1996). Freeform Shape Machining Using Minkowski Operations. UU-CS 1996-24. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Stappen, A.F. van der & Overmars, M.H. (1996). Geometrix eccentricity and the complexity of manipulation plans. UU-CS 1996-49. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Vleugels, J.M., Ferrucci, V., Overmars, M.H. & Rao, A.S. (1996). Hunting voronoi vertices. Computational Geometry: Theory and Applications, 6, 329-354.
|
Overmars, M.H., Rao, A.S., Cheong, O. & Wentink, C.J. (1996). Immobilizing polygons against a wall. UU-CS 1996-11. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Svestka, P. & Overmars, M.H. (1996). Multi-Robot path planning with super-graphs. In Proceedings of the Symposium on Robotics and Cybernetics (pp. 482-487).
|
Svestka, P. & Overmars, M.H. (1996). Multi-level path planning for nonholonomic robots using semi-holonomic subsystems. UU-CS 1996-08. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Sekhavat, S., Svestka, P., Laumond, J.P. & Overmars, M.H. (1996). Multi-level path planning for nonholonomic robots using semi-holonomic subsystems. In J.P. Laumond & M.H. Overmars (Eds.), Algorithmic Foundations of Robotics. Toulouse, France.
|
Overmars, M.H. & Svestka, P. (1996). Probabilistic approaches to motion planning. In K. Jeffery, J. Kral & M. Bartosek (Eds.), SOFSEM'96 Theory and Practice of Informatics (pp. 95-112). Springer Verlag.
|
Sekhavat, S., Svestka, P., Laumond, J.P. & Overmars, M.H. (1996). Probabilistic path planning for tractor-trailer robots. Toulouse, France: LAAS-CNRS.
|
Kavraki, L., Svestka, P., Latombe, J.C. & Overmars, M.H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE transactions on robotics and automation, 12, 566-580.
|
Overmars, M.H. & Stappen, A.F. van der (1996). Range searching and point location among fat objects. Journal of Algorithms, 21, 629-656.
|
Knobbe, A.J., Kok, J.N. & Overmars, M.H. (1996). Robot motion planning in unknown environments using Neural Networks. UU-CS 1996-10. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Kreveld, M.J. van, Oostrum, R.W. van & Overmars, M.H. (1996). Simple traversal of a subdivision without extra storage. UU-CS 1996-17. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Berg, M.T. de, Oostrum, R.W. van & Overmars, M.H. (1996). Simple traversal of a subdivision without extra strorage, short communication. In Proceedings of the 12th ACM Symposium on Computational Geometry (pp. C5-C6). New York, U.S.A.: ACM Press.
|
Berg, M.T. de, Bose, P., Dobrindt, K., Kreveld, M.J. van, Overmars, M.H., Groot, M. de, Roos, T., Snoeyink, J. & Yu, S. (1996). The complexity of rivers in triangulated terrains. In Proceedings of the 8th Canadian Conference on Computational Geometry (pp. 325-330). Ottawa, Canada.
|
Guibas, L.J., Overmars, M.H. & Robert, J.M. (1996). The exact fitting problem in higher dimensions. Computational geometry, 6, 215-230.
|
Overmars, M.H. & Svestka, P. (1996). The probabilistic path planner: A general approach to robot motion planning. In S. Banka, S. Domek & Z. Emirsajlow (Eds.), Proceedings of Methods and Models in Automation and Robotics 1996 (pp. 909-916). Miedzyzdroje, Poland.
|
Vleugels, J.M. & Overmars, M.H. (1995). Approximating generalized Voronoi diagrams in any dimension. UU-CS 1995-14. Utrecht: Utrecht University.
|
Stappen, A.F. van der & Overmars, M.H. (1995). Motion planning in environments with low obstacle density. UU-CS 1995-33. Utrecht: Utrecht University.
|
Svestka, P. & Overmars, M.H. (1995). Probabilistic path planning. UU-CS 1995-22. Utrecht: Utrecht University.
|
Overmars, M.H. & Svestka, P. (1994). A probablisitic learning approach to motion planning. UU-CS 1994-03. Utrecht.
|
Asberg, B. & Overmars, M.H. (1994). Feasibility of design in stereolithography. UU-CS 1994-25. Utrecht.
|
Ferruccie, V., Overmars, M.H., Rao, A.S. & Vleugels, J.M. (1994). Hunting Voronoi vertices. UU-CS 1994-31. Utrecht.
|
Svestka, P. & Overmars, M.H. (1994). Motion planning for car-like robots using a probabilistic learning approach. UU-CS 1994-33. Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1994). New Results on Binary Space Partitions in the Plane. UU-CS 1994-51. Utrecht.
|
Kavraki, L., Svestka, P. & Overmars, M.H. (1994). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. UU-CS 1994-32. Utrecht.
|
Overmars, M.H. & Stappen, A.F. van der (1994). Range searching and point location among fat objects. UU-CS 1994-30. Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Cheong, O. (1994). Reaching a goal with directional uncertainty. UU-CS 1994-09. Utrecht.
|
Halperin, D. & Overmars, M.H. (1994). Spheres, molecules, and hidden surface removal. UU-CS 1994-36. Utrecht.
|
Bose, P. & Overmars, M.H. (1994). The floodlight problem. UU-CS 1994-17. Utrecht.
|
Vleugels, J.M., Kok, J.N. & Overmars, M.H. (1993). Motion planning using a colored Kohonen network. RUU-CS 93-38. Utrecht.
|
Gajentaan, A. & Overmars, M.H. (1993). On a class of O(n2) problems in computational geometry. RUU-CS 93-15. Utrecht.
|
Overmars, M.H. & Berg, M.T. de (1993). Perfect Binary Space Partitions. RUU-CS 93-23. Utrecht.
|
Overmars, M.H. (1993). Teaching computational geometry. RUU-CS 93-34. Utrecht.
|
Overmars, M.H. (1992). A random approach to motion planning. RUU-CS 92-32. Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Kreveld, M.J. van (1992). Sparse arrangements and the number of views of polyhedral scenes. RUU-CS 92-24. Utrecht.
|
Overmars, M.H. & Stappen, A.F. van der (1992). The complexity of the free space for a robot moving amidst fat obstacles. RUU-CS 92-05. Utrecht.
|
Robert, J.M. & Overmars, M.H. (1992). The exact fitting problem in higher dimensions. RUU-CS 92-37. Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Cheong, O. (1991). Computing and verifying depth orders. RUU-CS 91-41. Utrecht.
|
Katz, M.J. & Overmars, M.H. (1991). Efficient hidden surface removal for objects with small union size. RUU-CS 91-31. Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1991). Efficient ray shooting and hidden surface removal. RUU-CS 91-28. Utrecht.
|
Agarwal, K., Kreveld, M.J. van & Overmars, M.H. (1991). Intersection queries in curved objects. RUU-CS 91-12. Utrecht.
|
Adegeest, J. & Overmars, M.H. (1991). Minimum-link c-oriented path queries. RUU-CS 91-27. Utrecht.
|
Overmars, M.H. (1991). Point location in fat subdivisions. RUU-CS 91-40. Utrecht.
|
Berg, M.T. de, Kreveld, M.J. van & Overmars, M.H. (1991). Shortest path queries in rectilinear words. RUU-CS 91-20. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1991). Union-copy structures and dynamic segment trees. RUU-CS 91-05. Utrecht.
|
Berg, M.T. de, Kreveld, M.J. van & Overmars, M.H. (1990). Finding shortest paths in the presence of orthogonal obstacles using a combined L1 and link metric. RUU-CS 90-20. Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1990). Hidden surface removal for axis-parallel polyhedra (extended abstract). RUU-CS 90-21. Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1990). Hidden surface removel for $c$-oriented polyhedra. RUU-CS 90-33. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1990). Intersection queries in sets of disks. RUU-CS 90-13. Utrecht.
|
La Poutré, J.A., Leeuwen, J. van & Overmars, M.H. (1990). Maintaining 2- and 3-connected components in graphs, Part I: 2- and 3-edge-connected components. RUU-CS 90-26. Utrecht.
|
Overmars, M.H. (1990). Merging visibility maps. RUU-CS 90-09. Utrecht.
|
Sharir, M. & Overmars, M.H. (1989). A simple output-sensitive algorithm for hidden surface removal. RUU-CS 89-26. Utrecht.
|
Sharir, M. & Overmars, M.H. (1989). An improved technique for output-sensitive hidden surface removal. RUU-CS 89-32. Utrecht.
|
Goodrich, G.L. & Overmars, M.H. (1989). An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal. RUU-CS 89-24. Utrecht.
|
Overmars, M.H. (1989). Computational geometry and its application to computer graphics. RUU-CS 89-08. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1989). Concatenable structures for decomposable problems. RUU-CS 89-16. Utrecht.
|
Guibas, L.J. & Overmars, M.H. (1989). Counting and reporting intersections in arrangements. RUU-CS 89-12. Utrecht.
|
Schipper, M. & Overmars, M.H. (1989). Dynamic partition trees. RUU-CS 89-25. Utrecht.
|
Berg, M.T. de, Overmars, M.H. & Kreveld, M.J. van (1989). Finding complete bipartite subgraphs in bipartite graphs. RUU-CS 89-30. Utrecht.
|
Overmars, M.H. (1989). Finding minimum area k-gons. RUU-CS 89-07. Utrecht.
|
Overmars, M.H. (1989). New upperbounds in Klee's measure problem. RUU-CS 89-28. Utrecht.
|
Edelsbrunner, H. & Overmars, M.H. (1989). Ranking intervals under visibility constraints. RUU-CS 89-18. Utrecht.
|
Guibas, L.J. & Overmars, M.H. (1989). Ray shooting, implicit point location, and related queries in arrangements of segments. RUU-CS 89-11. Utrecht.
|
Overmars, M.H. (1989). Storing line segments in partition trees. RUU-CS 89-17. Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1988). A general approach to dominance in the plane. RUU-CS 88-35. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1988). Concatenable segment trees. RUU-CS 88-36. Utrecht.
|
Overmars, M.H. (1988). Connectability problems. RUU-CS 88-21. Utrecht.
|
Lentfert, P. & Overmars, M.H. (1988). Data structures in a real-time environment. RUU-CS 88-01. Utrecht.
|
Kreveld, M.J. van & Overmars, M.H. (1988). Divided k-d trees. RUU-CS 88-28. Utrecht.
|
Berg, M.T. de & Overmars, M.H. (1988). Dominance in the presence of obstacles. RUU-CS 88-10. Utrecht.
|
Halperin, D. & Overmars, M.H. (1988). Efficient motion planning for an L-shaped object. RUU-CS 88-38. Utrecht.
|
Guibas, L.J. & Overmars, M.H. (1988). Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques. RUU-CS 88-26. Utrecht.
|
Smid, G.A. & Overmars, M.H. (1988). Maintaining multiple representations of dynamic data structures. RUU-CS 88-27. Utrecht.
|
Overmars, M.H. (1988). New methods for computing visibility graphs (extended abstract). RUU-CS 88-07. Utrecht.
|
Overmars, M.H. (1988). New upper bounds in Klees measure problem (extended abstract). RUU-CS 88-22. Utrecht.
|
Dobkin, D.P. & Overmars, M.H. (1988). Searching for empty convex polygons. RUU-CS 88-11. Utrecht.
|
Overmars, M.H. (1988). Sets without empty convex 6-gons. RUU-CS 88-12. Utrecht.
|
Overmars, M.H. (1987). A balanced search tree with 0(1) worst-case update time. RUU-CS 87-08. Utrecht.
|
Overmars, M.H. (1987). Computational geometry on a grid; an overview. RUU-CS 87-04. Utrecht.
|
Overmars, M.H. (1987). Construction of sparse visibility graphs. RUU-CS 87-09. Utrecht.
|
Overmars, M.H. (1987). Efficient data structures for range searching on a grid. RUU-CS 87-02. Utrecht.
|
Overmars, M.H. (1987). Geometric data structures for computer graphics; an overview. RUU-CS 87-05. Utrecht.
|
Overmars, M.H., Berg, M.T. de & Kreveld, M.J. van (1987). Maintaining range trees in secondary memory Part I; Partitions. RUU-CS 87-20. Utrecht.
|
Smid, G.A. & Overmars, M.H. (1987). Maintaining range trees in secondary memory Part II; lower bounds. RUU-CS 87-21. Utrecht.
|
Smid, G.A. & Overmars, M.H. (1987). Partitioning range trees. RUU-CS 87-03. Utrecht.
|
Smid, G.A. & Overmars, M.H. (1987). Two models for the reconstruction problem for dynamic data structures. RUU-CS 87-16. Utrecht.
|
Karlsson, J-O & Overmars, M.H. (1986). Normalized divide and conquer ; a scaling technique for solving multi-dimensional problems. RUU-CS 86-19. Utrecht.
|
Overmars, M.H. (1986). On rectangular visibility. RUU-CS 86-20. Utrecht.
|
Karlsson, J-O & Overmars, M.H. (1986). Scanline algorithms on a grid. RUU-CS 86-18. Utrecht.
|
Smid, G.A. & Overmars, M.H. (1986). The reconstruction of dynamic data structures. RUU-CS 86-21. Utrecht.
|
Scholten, E. & Overmars, M.H. (1985). General methods for adding range restrictions to decomposable searching problems. RUU-CS 85-21. Utrecht.
|
Overmars, M.H. (1985). Geometric data structures for computer graphics. RUU-CS 85-13. Utrecht.
|
Overmars, M.H. (1985). Range searching on a grid. RUU-CS 85-17. Utrecht.
|
Overmars, M.H. (1985). The complexity of cutting paper. RUU-CS 85-06. Utrecht.
|
Katajainen, J. & Overmars, M.H. (1985). The inverted file tree machine!: efficient multi-key retrieval for VLSI. RUU-CS 85-08. Utrecht: Universiteit Utrecht.
|
Edelsbrunner, H. & Overmars, M.H. (1983). Batched dynamic solutions to decomposable searching problems. RUU-CS 83-08. Utrecht.
|
Overmars, M.H. (1983). Range searching in a set of line segments. RUU-CS 83-06. Utrecht.
|
Overmars, M.H. (1983). The locus approach. RUU-CS 83-12. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1981). Maintenance of configurations in the plane (revised edition). RUU-CS 81-03. Utrecht.
|
Overmars, M.H. (1981). On the equivalence of rectangle containment, rectangle enclosure and ECDF-searching. RUU-CS 81-01. Utrecht.
|
Edelsbrunner, H. & Overmars, M.H. (1981). On the equivalence of some rectangle problems. RUU-CS 81-15. Utrecht.
|
Overmars, M.H. (1981). Searching in the past I. RUU-CS 81-07. Utrecht.
|
Overmars, M.H. (1981). Searching in the past II- general transformations. RUU-CS 81-09. Utrecht.
|
Leeuwen, J. van & Overmars, M.H. (1981). Stratified balanced search trees. RUU-CS 81-04. Utrecht.
|
Leeuwen, J. van & Overmars, M.H. (1981). The art of dynamizing. RUU-CS 81-08. Utrecht.
|
Overmars, M.H. (1981). Transforming semi-dynamic data structures into dynamic structures. RUU-CS 81-10. Utrecht.
|
Leeuwen, J. van & Overmars, M.H. (1981). VLSI layouts of perfect binary trees (to appear). RUU-CS 81-13. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Dynamic multi-dimensional data structures based on quad- and k-d trees. RUU-CS 80-02. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Dynamization of decomposable searching problems yielding good worst case bounds. RUU-CS 80-06. Utrecht.
|
Overmars, M.H. (1980). Dynamization of order decomposable set problems. RUU-CS 80-09. Utrecht.
|
Overmars, M.H. (1980). General methods for the all elements and all pairs problem. RUU-CS 80-07. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Notes on maintenance of configurations in the plane. RUU-CS 80-05. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Some principles for dynamizing decomposable searching problems. RUU-CS 80-01. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Worst case optimal insertion and deletion methods for decomposable searching problems. RUU-CS 80-10. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1979). Further comments on Bykat's convex hull algorithm. RUU-CS 79-07. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1979). Maintenance of configurations in the plane. RUU-CS 79-09. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1979). Rapid subtree indentification revisited. RUU-CS 79-03. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1979). Two general methods for dynamizing decomposable searching problems. RUU-CS 79-10. Utrecht.
|
webmaster@cs.uu.nl,
Sun, 20 May 2012 11:44:54 +0200
←
Departement Informatica, Universiteit Utrecht