The following pages link to (Q4133127):
Displaying 48 items.
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- Optimal parallel algorithms for computing convex hulls and for sorting (Q594601) (← links)
- Space sweep solves intersection of convex polyhedra (Q759486) (← links)
- Minimum vertex distance between separable convex polygons (Q789904) (← links)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane (Q793982) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- Some dynamic computational geometry problems (Q1071526) (← links)
- Polygonizations of point sets in the plane (Q1093906) (← links)
- On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
- A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994) (← links)
- Analytical models for locating undesirable facilities (Q1118522) (← links)
- Euclidean geometry in terms of automata theory (Q1124346) (← links)
- Voronoi diagrams from convex hulls (Q1135110) (← links)
- On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination (Q1140425) (← links)
- A note on finding convex hulls via maximal vectors (Q1144946) (← links)
- Finding efficient solutions for rectilinear distance location problems efficiently (Q1148204) (← links)
- How to reduce the average complexity of convex hull finding algorithms (Q1151049) (← links)
- A space-optimal solution of general region location (Q1156491) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
- Computing the convex hull in a hammock (Q1177390) (← links)
- Detecting the intersection of convex objects in the plane (Q1183506) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← links)
- An application of pattern matching to a problem in geometrical complexity (Q1234596) (← links)
- A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them (Q1244052) (← links)
- An improved algorithm to check for polygon similarity (Q1245010) (← links)
- The all nearest-neighbor problem for convex polygons (Q1250433) (← links)
- Some remarks on the Steiner problem (Q1251668) (← links)
- A fast convex hull algorithm (Q1251805) (← links)
- A note on the graph isomorphism counting problem (Q1253098) (← links)
- Finding the intersection of two convex polyhedra (Q1253450) (← links)
- Divide and conquer for linear expected time (Q1256853) (← links)
- A note on Rabin's nearest-neighbor algorithm (Q1257342) (← links)
- Vehicle routing with a sparse feasibility graph (Q1278726) (← links)
- Geometrical tools in classification (Q1350810) (← links)
- A unifying approach for a class of problems in the computational geometry of polygons (Q1822499) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- \(\alpha\)-kernel problem with fuzzy visibility (Q1920271) (← links)
- On polyhedra induced by point sets in space (Q2462350) (← links)
- An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case (Q2637298) (← links)
- On geometric automata which can nondeterministically choose auxiliary points (Q3484387) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- Rooted Uniform Monotone Minimum Spanning Trees (Q5283385) (← links)
- The complexity of linear programming (Q5904560) (← links)
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449) (← links)
