The following pages link to Michiel H. M. Smid (Q582044):
Displayed 50 items.
- Item:Q582044 (redirect page) (← links)
- Item:Q582044 (redirect page) (← links)
- A technique for adding range restrictions to generalized searching problems (Q293144) (← links)
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592) (← links)
- A lower bound for approximating the geometric minimum weight matching (Q294775) (← links)
- Probing convex polygons with a wedge (Q340529) (← links)
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Data structures for range-aggregate extent queries (Q390147) (← links)
- An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (Q390152) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- On a family of strong geometric spanners that admit local routing strategies (Q551501) (← links)
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- Geometric spanners for weighted point sets (Q634687) (← links)
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions (Q679740) (← links)
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (Q679748) (← links)
- Fixed-orientation equilateral triangle matching of point sets (Q744055) (← links)
- Constructing plane spanners of bounded degree and low weight (Q818655) (← links)
- Tight bounds on the clique chromatic number (Q820840) (← links)
- Closest-pair queries and minimum-weight queries are equivalent for squares (Q824331) (← links)
- An improved construction for spanners of disks (Q827306) (← links)
- The minimum moving spanning tree problem (Q832829) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- Dynamic deferred data structuring (Q917273) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Geometric spanners with small chromatic number (Q955227) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- An \(\Omega (n\log n)\) lower bound for computing the sum of even-ranked elements (Q989536) (← links)
- A linear-space algorithm for distance preserving graph embedding (Q1005326) (← links)
- Rotationally monotone polygons (Q1025304) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Clamshell casting (Q1031870) (← links)
- Maintaining range trees in secondary memory. Part I: Partitions (Q1120266) (← links)
- Maintaining range trees is secondary memory. Part II: Lower bounds (Q1120282) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- On some geometric optimization problems in layered manufacturing (Q1305892) (← links)
- Minimizing support structures and trapped area in two-dimensional layered manufacturing (Q1305894) (← links)
- An optimal algorithm for the on-line closest-pair problem (Q1330783) (← links)
- Dynamic rectangular point location, with an application to the closest pair problem (Q1346711) (← links)
- Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity (Q1346775) (← links)
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q1386771) (← links)
- An optimal algorithm for plane matchings in multipartite geometric graphs (Q1616235) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)