The following pages link to (Q3992847):
Displaying 50 items.
- Digitization scheme that assures faithful reconstruction of plane figures (Q1023427) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Optimal algorithm for a special point-labeling problem (Q1029054) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Finding the \(\Theta \)-guarded region (Q1037785) (← links)
- Robustness of \(k\)-gon Voronoi diagram construction (Q1045919) (← links)
- A linear time algorithm for obtaining the convex hull of a simple polygon (Q1053995) (← links)
- Finding extreme points in three dimensions and solving the post-office problem in the plane (Q1069424) (← links)
- Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
- Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
- Computing relative neighbourhood graphs in the plane (Q1082094) (← links)
- Finding transversals for sets of simple geometric figures (Q1083215) (← links)
- On the use of composite grid schemes in computational aerodynamics (Q1085731) (← links)
- Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
- Geometric containment and vector dominance (Q1093914) (← links)
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations (Q1094872) (← links)
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations (Q1095812) (← links)
- A variant of Ben-Or's lower bound for algebraic decision trees (Q1096401) (← links)
- Motion planning among time dependent obstacles (Q1096427) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- An O(n) algorithm for least squares quasi-convex approximation (Q1097626) (← links)
- On the numerical condition of polynomials in Bernstein form (Q1098225) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- Optimal piecewise linear motion of an object among obstacles (Q1098643) (← links)
- On problem transformability in VLSI (Q1101222) (← links)
- A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- Geometric optimization and the polynomial hierarchy (Q1102110) (← links)
- Parallel algorithms for some functions of two convex polygons (Q1105374) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← links)
- The expected size of some graphs in computational geometry (Q1106021) (← links)
- Line arrangements and range search (Q1107313) (← links)
- Obtaining lower bounds using artificial components (Q1107991) (← links)
- An O(log n) time parallel algorithm for triangulating a set of points in the plane (Q1107999) (← links)
- A linear expected-time algorithm for computing planar relative neighbourhood graphs (Q1108002) (← links)
- A log log n data structure for three-sided range queries (Q1108025) (← links)
- A non-Hamiltonian, nondegenerate Delaunay triangulation (Q1108041) (← links)
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
- Establishing order in planar subdivisions (Q1115185) (← links)
- An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187) (← links)
- Parallel computational geometry (Q1115600) (← links)
- Constrained Delaunay triangulations (Q1115601) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- Circular discs containing eigenvalues of normal matrices (Q1117006) (← links)
- A space efficient greedy triangulation algorithm (Q1120272) (← links)
- A simple linear-time algorithm for computing the ring and MST of unimodal polygons (Q1120279) (← links)
- A study on two geometric location problems (Q1122367) (← links)
