The following pages link to Marc J. van Kreveld (Q1120265):
Displaying 50 items.
- (Q294598) (redirect page) (← links)
- (Q1000924) (redirect page) (← links)
- Labeling a rectilinear map more efficiently (Q294599) (← links)
- Google Scholar makes it hard -- the complexity of organizing one's publications (Q495683) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- Finding long and similar parts of trajectories (Q654283) (← links)
- Bold graph drawings (Q654288) (← links)
- The power of parallel projection (Q685515) (← links)
- Blocking Delaunay triangulations (Q691770) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- (Q802871) (redirect page) (← links)
- Finding squares and rectangles in sets of points (Q802873) (← links)
- Between shapes, using the Hausdorff distance (Q824335) (← links)
- Linear-time reconstruction of Delaunay triangulations with applications (Q826118) (← links)
- Mapping multiple regions to the grid with bounded Hausdorff distance (Q832913) (← links)
- Diverse partitions of colored points (Q832914) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Generating realistic terrains with higher-order Delaunay triangulations (Q870427) (← links)
- On rectangular cartograms (Q883236) (← links)
- On realistic terrains (Q934023) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Approximating largest convex hulls for imprecise points (Q1002103) (← links)
- Towards a definition of higher order constrained Delaunay triangulations (Q1005329) (← links)
- Edges and switches, tunnels and bridges (Q1028235) (← links)
- Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Maintaining range trees in secondary memory. Part I: Partitions (Q1120266) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- Intersection queries in sets of disks (Q1196457) (← links)
- (Q1271281) (redirect page) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q1271283) (← links)
- Label placement by maximum independent set in rectangles (Q1276946) (← links)
- Point labeling with sliding labels (Q1305862) (← links)
- Concatenable structures for decomposable problems (Q1322468) (← 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)
- Determining the castability of simple polyhedra (Q1364364) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q1384209) (← links)
- Filling polyhedral molds. (Q1401872) (← links)
- Facility location on a polyhedral surface (Q1434248) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Schematization of networks (Q1776896) (← links)
- Constrained higher order Delaunay triangulations (Q1776901) (← links)
- Translating a regular grid over a point set (Q1873153) (← links)
- Approximation algorithms for aligning points (Q1879366) (← links)
- Folding rulers inside triangles (Q1913598) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
