WorldCat Identities

Overmars, Mark H. 1958-

Overview
Works: 132 works in 298 publications in 2 languages and 2,822 library holdings
Genres: Conference proceedings 
Roles: Editor, Contributor, Other
Classifications: QA76.76.C672, 001.64
Publication Timeline
Key
Publications about  Mark H Overmars Publications about Mark H Overmars
Publications by  Mark H Overmars Publications by Mark H Overmars
Most widely held works by Mark H Overmars
The game maker's apprentice game development for beginners by Jacob Habgood ( )
17 editions published between 2006 and 2013 in English and held by 757 WorldCat member libraries worldwide
"Game Maker allows you to begin creating games almost immediately, using a simple drag-and-drop system that makes learning to program much easier than traditional programming languages. This book brings together the expertise of Game Maker's creator with a professional game developer to present a complete guide to designing and programming games that are fun to play."--Jacket
The design of dynamic data structures by Mark H Overmars ( Book )
20 editions published between 1983 and 1987 in English and German and held by 479 WorldCat member libraries worldwide
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures
Motion in Games First International Workshop, MIG 2008, Utrecht, the Netherlands, June 14-17, 2008 : revised papers by MIG 2008 ( )
11 editions published in 2008 in English and held by 410 WorldCat member libraries worldwide
Motion in games second international workshop, MIG 2009, Zeist, the Netherlands, November 21-24, 2009 ; proceedings by Arjan Egges ( )
12 editions published in 2009 in English and held by 401 WorldCat member libraries worldwide
Annotation
Learning C# by programming games by Arjan Egges ( )
7 editions published in 2013 in English and German and held by 258 WorldCat member libraries worldwide
C# is the language of choice for learning how to program. It is a very well structured object-oriented language and avoids some of the problems of Java. An excellent free programming environment is available for C#, as well as a game programming framework. And (if necessary) moving from C# to C++ is easy. Developing computer games is a perfect way to learn how to program in modern programming languages. This book teaches how to program in C# through the creation of computer games - and without requiring any previous programming experience. Contrary to most programming books, Egges, Fokker and
Algorithms for robotic motion and manipulation : 1996 Workshop on the Algorithmic Foundations of Robotics by Workshop on the Algorithmic Foundations of Robotics. WAFR ( Book )
7 editions published in 1997 in English and held by 150 WorldCat member libraries worldwide
Games ontwerpen met Game Maker by Mark H Overmars ( Book )
1 edition published in 2007 in English and held by 69 WorldCat member libraries worldwide
Stap voor stap en met illustraties in zwart-wit wordt uitgelegd hoe je met het programma Game Maker computerspelletjes kunt maken. Vanaf ca. 13 jaar
Motion in Games First International Workshop, MIG 2008, Utrecht, the Netherlands, June 14-17, 2008. Revised Papers by D Hutchison ( )
2 editions published in 2008 in English and held by 21 WorldCat member libraries worldwide
Searching for empty convex polygons by David P Dobkin ( Book )
3 editions published in 1988 in English and held by 14 WorldCat member libraries worldwide
Ranking intervals under visibility constraints by Herbert Edelsbrunner ( Book )
5 editions published in 1989 in 3 languages and held by 12 WorldCat member libraries worldwide
On rectangular visibility by Mark H Overmars ( Book )
4 editions published in 1986 in English and Undetermined and held by 7 WorldCat member libraries worldwide
Efficient motion planning for an L-shaped object by Dan Halperin ( Book )
4 editions published in 1988 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We present an algorithm that solves the following motion-planning problem. Given an L-shaped body L and a 2-dimensional region with n point obstacles, decide whether there is a continuous motion connecting two given positions and orientations of L during which L avoids collision with the obstacles. The algorithm requires O(n²log²n) time and O(n²) storage. The algorithm is a variant of the cell-decomposition technique of the configuration space ([SS, LS]) but it employs a new and efficient technique for obtaining a compact representation of the free space, which results in a saving of an order of magnitude. The approach used in our algorithm seems applicable to motion-planning of certain robotic arms whose spaces of free placements have a structure similar to that of the L-shaped body."
Counting and reporting intersections in arrangements of line segments by Leonidas J Guibas ( Book )
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Ray shooting, implicit point location, and related queries in arrangements of segments by Leonidas J Guibas ( Book )
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Intersection queries in curved objects by Pankaj K Agarwal ( Book )
3 editions published in 1991 in English and Undetermined and held by 5 WorldCat member libraries worldwide
Abstract: "A number of problems of the following type are studied: Given a set of n arcs (disks, circles, circular arcs, Jordan arcs) in the plane, preprocess it into a data structure, such that for a query line (or segment) one can quickly (i) report all arcs intersecting it, or (ii) count the number of arcs intersecting it. We also study the ray shooting problem in disjoint Jordan arcs, and circular arcs. Most of the data structures presented here use near to linear space and have query time near to O([square root of]n + K) or near to O(n[superscript 2/3] + K), where K is the size of the output."
Teaching computational geometry by Mark H Overmars ( Book )
2 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide
Abstract: "This paper describes a possible approach to teaching computational geometry to students. It gives a brief introduction in computational geometry, followed by three possible ways of treating the area: mathematically, algorithmically and application-oriented. Next a course outline is described, introducing computational geometry from an application-oriented point of view. Finally, some remarks are made about implementation issues."
Motion planning using a colored Kohonen network by Jules M Vleugels ( Book )
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
It has been implemented for planar robots allowing both translation and rotation, and experiments show that compared to conventional techniques it performs well, even for difficult motion planning scenes."
Coordinated path planning for multiple robots by Petr SĖ†vestka ( Book )
3 editions published in 1996 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment. Rather than the usual decoupled planning, we use a coordinated approach. As a result we can show that the method is probabilistically complete, that is, any solvable problem will be solved within a finite amount of time. A data- structure storing multi-robot motions is built in two steps. First, a roadmap is constructed for just one robot. For this we use the Probabilistic Path Planner, which guarantees that the approach can be easily applied to different robot types. In the second step, a number of these simple roadmaps are combined into a roadmap for the composite robot. This data-structure can be used for retrieving multi-robot paths. We have applied the method to car-like robots, and simulation results are presented which show that problems involving up to 5 car-like robots in complex environments are solved successfully in computation times in the order of seconds, after a preprocessing step (the construction of the data structure) that consumes, at most, a few minutes. Such a preprocessing step however needs to be performed just once, for a given static environment."
Intersection queries in sets of disks by Marc van Kreveld ( Book )
3 editions published in 1990 in English and held by 4 WorldCat member libraries worldwide
Storing line segments in partition trees by Mark H Overmars ( Book )
3 editions published in 1989 in English and Undetermined and held by 4 WorldCat member libraries worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.61 (from 0.17 for Games ontw ... to 0.96 for Searching ...)
Alternative Names
Overmars, M.
Overmars, M. H.
Overmars, Mark
Languages
English (108)
German (3)
Covers