The following pages link to Mark H. Overmars (Q419362):
Displaying 50 items.
- (Q223978) (redirect page) (← links)
- (Q1355727) (redirect page) (← links)
- On a class of \(O(n^2)\) problems in computational geometry (Q419363) (← links)
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- Reaching a goal with directional uncertainty (Q673767) (← links)
- Perfect binary space partitions (Q676587) (← links)
- Maintenance of 2- and 3-edge-connected components of graphs. I (Q685694) (← links)
- The design of dynamic data structures (Q797269) (← links)
- Dynamic partition trees (Q804289) (← links)
- Merging visibility maps (Q808306) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- Realizing partitions respecting full and partial order information (Q954955) (← links)
- Zooming by repeated range detection (Q1098306) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- A balanced search tree O(1) worst-case update time (Q1114387) (← links)
- General methods for adding range restrictions to decomposable searching problems (Q1118417) (← links)
- Maintaining range trees in secondary memory. Part I: Partitions (Q1120266) (← links)
- Maintaining range trees is secondary memory. Part II: Lower bounds (Q1120282) (← links)
- Further comments on Bykat's convex hull algorithm (Q1147518) (← links)
- Some principles for dynamizing decomposable searching problems (Q1149253) (← links)
- Two general methods for dynamizing decomposable searching problems (Q1149778) (← links)
- General methods for 'all elements' and 'all pairs' problems (Q1151265) (← links)
- Worst-case optimal insertion and deletion methods for decomposable searching problems (Q1152223) (← links)
- Optimal dynamization of decomposable searching problems (Q1153688) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- On the equivalence of some rectangle problems (Q1165008) (← links)
- Dynamic multi-dimensional data structures based on quad- and k-d trees (Q1166932) (← links)
- Stratified balanced search trees (Q1168743) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
- Intersection queries in sets of disks (Q1196457) (← links)
- Efficient hidden surface removal for objects with small union size (Q1208434) (← links)
- Point location in fat subdivisions (Q1209353) (← links)
- Computing fence designs for orienting parts (Q1265285) (← links)
- Spheres, molecules, and hidden surface removal (Q1272310) (← links)
- Motion planning in environments with low obstacle density (Q1275680) (← links)
- Dynamic motion planning in low obstacle density environments (Q1276943) (← links)
- The complexity of the free space for a robot moving amidst fat obstacles (Q1314536) (← links)
- Output-sensitive methods for rectilinear hidden surface removal (Q1317431) (← links)
- Concatenable structures for decomposable problems (Q1322468) (← links)
- An improved technique for output-sensitive hidden surface removal (Q1322562) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- Improved bounds for electing a leader in a synchronous ring (Q1355728) (← links)
- Feasibility of design in stereolithography (Q1364363) (← links)
- New results on binary space partitions in the plane (Q1370930) (← links)
- Interference-free NC machining using spatial planning and Minkowski operations. (Q1401877) (← links)
- Guarding scenes against invasive hypercubes. (Q1405005) (← links)
- Preprocessing chains for fast dihedral rotations is hard or even impossible. (Q1410594) (← links)
