Overmars, Mark. H., 1958-
Overmars, Mark H. (Markus Hendrik), 1958-
Overmars, Mark H.
Mark Overmars Nederlands wiskundige
Mark Overmars Dutch computer scientist
VIAF ID: 94613809 ( Personal )
Permalink: http://viaf.org/viaf/94613809
Preferred Forms
- 100 0 _ ‡a Mark Overmars ‡c Dutch computer scientist
- 100 0 _ ‡a Mark Overmars ‡c Nederlands wiskundige
-
-
-
- 100 1 _ ‡a Overmars, Mark H.
-
- 100 1 _ ‡a Overmars, Mark H. ‡d 1958-
-
-
-
- 100 1 _ ‡a Overmars, Mark H., ‡d 1958-
- 100 1 _ ‡a Overmars, Mark H., ‡d 1958-....
-
4xx's: Alternate Name Forms (22)
5xx's: Related Names (3)
- 510 2 _ ‡a Tingly Games ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Universiteit Utrecht ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 551 _ _ ‡a Zeist ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
Works
Title | Sources |
---|---|
Algorithmic foundations of robotics. | |
Algorithms for fixture design | |
Algorithms for robotic motion and manipulation : proceedings | |
Approximating generalized Voronoi diagrams in any dimension | |
A balanced search tree with O(1) worst-case update time | |
The complexity of the free space for a robot moving amidst fat obstacles | |
Computation of Voxel maps containing tool access directions for machining free-form shapes | |
Computational geometry and its application to computer graphics | |
Computing and verifying depts orders | |
Concatenable segment trees | |
Concatenable structures for decomposable problems | |
Connectability problems | |
Construction of sparse visibility graphs | |
Coordinated path planning for multiple robots | |
Data structures in a real-time environment | |
The Design of Dynamic Data Structures | |
Divided k-d trees | |
Dominance in the presence of obstacles | |
Dynamic motion planning in low obstacle density environments | |
Efficient data structures for range searching on a grid | |
Efficient motion planning for an L-shaped object | |
The exact fitting problem in higher dimensions | |
Finding complete bipartite subgraphs in bipartite graphs | |
Finding minimum area k-gons | |
Freedom shape machining using Minkowski operations | |
Games ontwerpen met Game Maker | |
Geometric data structures for computer graphics : an overview | |
Geometric eccentricity and the complexity of manipulation plans | |
Graphics in Flatland : a case study | |
Hidden surface removal for axis-parallel polyhedra | |
Immobilizing polygons against a wall | |
An improved technique for output-sensitive hidden surface removal | |
An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal | |
Intersection queries in sets of disks | |
Learning C# by Programming Games | |
Maintaining range trees in secondary memory | |
Merging visibility maps | |
MIG 2009 | |
Minimum-link c-oriented path queries | |
Motion in Games : Second International Workshop, MIG 2009, Zeist, The Netherlands, November 21-24, 2009 : proceedings | |
Motion planning using a colored kohonen network | |
n2-Hard problems in computational geometry | |
New methods for computing visibility graphs : extended abstract | |
New upper bounds in Klee's measure problem | |
Normalized divide and conquer : a scaling technique for solving multi-dimensional problems | |
Perfect binary space partitions | |
Point location in fat subdivisions | |
Probablistic path planning | |
A random approach to motion planning | |
Range searching and point location among fat objects | |
Ranking intervals under visibility constraints | |
Ray shooting, implicit point location, and related queries in arrangements of segments | |
Robot motion planning in unknown environments using neural networks | |
Scanline algorithms on a grid | |
Searching for empty convex polygons | |
Sets without empty convex 6-gons | |
Spheres, molecules, and hidden surface removal | |
Storing line segments in partition trees |