The following pages link to (Q3992847):
Displaying 50 items.
- An upper bound on the shortness exponent of inscribable polytopes (Q1122592) (← links)
- A set operation algorithm for sculptured solids modeled with trimmed patches (Q1122931) (← links)
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems (Q1123609) (← links)
- Approximating the diameter of a set of points in the Euclidean space (Q1123610) (← links)
- Voronoi diagrams with barriers and the shortest diagonal problem (Q1123618) (← links)
- Euclidean geometry in terms of automata theory (Q1124346) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- Solution approaches to irregular nesting problems (Q1127203) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← links)
- A note on Delaunay and optimal triangulations (Q1151398) (← links)
- Worst-case optimal insertion and deletion methods for decomposable searching problems (Q1152223) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics (Q1165014) (← links)
- On the multimodality of distances in convex polygons (Q1165585) (← links)
- Restricted-oriented convex sets (Q1174335) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Computing the convex hull in a hammock (Q1177390) (← links)
- Computing the minimum Hausdorff distance between two point sets on a line under translation (Q1178208) (← links)
- Computing dominances in \(E^ n\) (Q1178238) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Divided \(k-d\) trees (Q1180539) (← links)
- Improved complexity bounds for location problems on the real line (Q1180820) (← links)
- Fixed-radius near neighbors search (Q1182100) (← links)
- A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
- The excess-mass ellipsiod (Q1182767) (← links)
- On the difficulty of triangulating three-dimensional nonconvex polyhedra (Q1182990) (← links)
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces (Q1182991) (← links)
- On the complexity of the extreme points decision problem (Q1183448) (← links)
- Satisfying general proximity/similarity queries with metric trees (Q1183466) (← links)
- Delaunay triangulation of arbitrarily shaped planar domains (Q1183535) (← links)
- Randomized incremental construction of Delaunay and Voronoi diagrams (Q1185289) (← links)
- Classes of graphs which approximate the complete Euclidean graph (Q1186079) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Learning in parallel (Q1187024) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Parallel computational geometry of rectangles (Q1187198) (← links)
- Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers (Q1187199) (← links)
- Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- Off-line dynamic maintenance of the width of a planar point set (Q1190292) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- Automatic mesh generator with specified boundary (Q1191976) (← links)
- On the covering multiplicity of lattices (Q1193702) (← links)
- Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
