The following pages link to (Q3992847):
Displaying 50 items.
- Affine invariant comparison of point-sets using convex hulls and Hausdorff distances (Q853144) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- Digital planarity -- a review (Q869568) (← links)
- Generators, extremals and bases of max cones (Q869908) (← links)
- Finding shortest path in the presence of barriers: an alternate approach (Q870173) (← links)
- Parametric multiple sequence alignment and phylogeny construction (Q876718) (← links)
- A simple algorithm for digital line recognition in the general case (Q877107) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← links)
- On the edge crossing properties of Euclidean minimum weight Laman graphs (Q902420) (← links)
- Convex blocking and partial orders on the plane (Q902426) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Finding nearest neighbors with Voronoi tessellations (Q910225) (← links)
- A straightforward iterative algorithm for the planar Voronoi diagram (Q910230) (← links)
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Realizability of Delaunay triangulations (Q911323) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs (Q916391) (← links)
- Finding Hamiltonian cycles in certain planar graphs (Q916416) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- Efficient dynamic algorithms for some geometric intersection problems (Q918702) (← links)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Generalized Delaunay triangulations of non-convex domains (Q922670) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- An algorithm for the difference between set covers (Q944712) (← links)
- The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing (Q945942) (← links)
- Solving continuous location-districting problems with Voronoi diagrams (Q947939) (← links)
- A research note on design of fair surfaces over irregular domains using data-dependent triangulation (Q949998) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Image deformations are better than optical flow (Q967938) (← links)
- Largest empty circle centered on a query line (Q972354) (← links)
- Approximating nearest neighbor among triangles in convex position (Q975498) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- Two-dimensional minimax Latin hypercube designs (Q1003737) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- Linear-time algorithm for finding a maximum-density segment of a sequence (Q1007643) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- A simple factor-3 approximation for labeling points with circles (Q1014403) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Fitting a \(C^m\)-smooth function to data. II (Q1017345) (← links)
- The \(C^m\) norm of a function with prescribed jets. II (Q1017346) (← links)
