The following pages link to Ferran Hurtado (Q170489):
Displaying 50 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Witness Gabriel graphs (Q359756) (← links)
- Draining a polygon-or-rolling a ball out of a polygon (Q390145) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Coverage restricted to an angle (Q433118) (← links)
- Balanced partitions of 3-colored geometric sets in the plane (Q479011) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- Blocking the \(k\)-holes of point sets in the plane (Q497316) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Distance 2-domination in prisms of graphs (Q521756) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- A generalized Winternitz theorem (Q657008) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- Witness rectangle graphs (Q742595) (← links)
- On the equipartition of plane convex bodies and convex polygons (Q811820) (← links)
- Directions in combinatorial geometry (Q814167) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- Geodesic ham-sandwich cuts (Q878384) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Augmenting the connectivity of geometric graphs (Q929747) (← links)
- Optimal location of transportation devices (Q945946) (← links)
- Flips in planar graphs (Q950400) (← links)
- The rotation graph of \(k\)-ary trees is Hamiltonian (Q975545) (← links)
- Matching points with squares (Q1006403) (← links)
- Voronoi diagram for services neighboring a highway (Q1007626) (← links)
- Point set stratification and Delaunay depth (Q1019881) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Highway hull revisited (Q1037778) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- On polygons enclosing point sets. II (Q1043822) (← links)
- (Q1126248) (redirect page) (← links)
- Triangulations, visibility graph and reflex vertices of a simple polygon (Q1126249) (← links)
- Stabbing information of a simple polygon (Q1283786) (← links)
- Geometric tree graphs of points in convex position (Q1289020) (← links)
- Properties of random triangulations and trees (Q1293354) (← links)
- (Q1351594) (redirect page) (← links)
- Onion polygonizations (Q1351597) (← links)
- Hiding points in arrangements of segments (Q1356667) (← links)
- Towards compatible triangulations. (Q1401254) (← links)
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position. (Q1410590) (← links)
- The weighted farthest color Voronoi diagram on trees and graphs. (Q1421027) (← links)
- Filtered wavelet thresholding methods. (Q1426753) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- On the number of views of translates of a cube and related problems. (Q1428117) (← links)
