The following pages link to (Q3992847):
Displaying 17 items.
- Digital planarity -- a review (Q869568) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Moldable and castable polygons (Q1334613) (← links)
- Toward the fast blind docking of a peptide to a target protein by using a four-body statistical pseudo-potential (Q1631157) (← links)
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
- Fuzzy clustering using the convex hull as geometrical model (Q1750199) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Quasi-optimal range searching in spaces of finite VC-dimension (Q1823698) (← links)
- Computing grasp functions (Q1917051) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- Generating random polygons with given vertices (Q1924712) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
