The following pages link to Mark T. de Berg (Q802872):
Displaying 50 items.
- (Q283879) (redirect page) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Computing a single cell in the overlay of two simple polygons (Q287185) (← links)
- Approximation algorithms for free-label maximization (Q419365) (← links)
- Unions of fat convex polytopes have short skeletons (Q443910) (← links)
- Out-of-order event processing in kinetic data structures (Q534768) (← links)
- Kinetic spanners in \(\mathbb R^{d}\) (Q540440) (← links)
- Geometric spanners for weighted point sets (Q634687) (← links)
- Shortcuts for the circle (Q670711) (← links)
- Reaching a goal with directional uncertainty (Q673767) (← links)
- Perfect binary space partitions (Q676587) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- Finding squares and rectangles in sets of points (Q802873) (← links)
- On rectilinear link distance (Q808302) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- Kinetic sorting and kinetic convex hulls (Q871059) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space (Q934024) (← links)
- Improved bounds on the union complexity of fat objects (Q946687) (← links)
- Cache-oblivious selection in sorted \(X+Y\) matrices (Q975535) (← links)
- Efficient \(c\)-oriented range searching with DOP-trees (Q1000927) (← links)
- On rectilinear duals for vertex-weighted plane graphs (Q1011760) (← links)
- Kinetic collision detection for convex fat objects (Q1016518) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Cache-oblivious R-trees (Q1017905) (← links)
- Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) (← links)
- Maintaining range trees in secondary memory. Part I: Partitions (Q1120266) (← links)
- Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra (Q1196293) (← links)
- (Q1271279) (redirect page) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q1271283) (← links)
- The union of moving polygonal pseudodiscs -- combinatorial bounds and applications (Q1272309) (← links)
- Motion planning in environments with low obstacle density (Q1275680) (← links)
- Ray shooting, depth orders and hidden surface removal (Q1309673) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- Rectilinear decompositions with low stabbing number (Q1341685) (← links)
- Trekking in the alps without freezing or getting tired (Q1361408) (← links)
- New results on binary space partitions in the plane (Q1370930) (← links)
- Guarding scenes against invasive hypercubes. (Q1405005) (← links)
- On simplifying dot maps. (Q1421029) (← links)
- Spanning trees crossing few barriers (Q1422228) (← links)
- Linear size binary space partitions for uncluttered scenes (Q1587784) (← links)
- Lower bounds for kinetic planar subdivisions (Q1591059) (← links)
- Models and motion planning (Q1614069) (← links)
- Dynamic conflict-free colorings in the plane (Q1631778) (← links)
- The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- Schematization of networks (Q1776896) (← links)
