scientific article; zbMATH DE number 3557226
From MaRDI portal
Publication:4133127
zbMath0357.68046MaRDI QIDQ4133127
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
Rooted Uniform Monotone Minimum Spanning Trees ⋮ New primal and dual matching heuristics ⋮ Polygonizations of point sets in the plane ⋮ Geometrical tools in classification ⋮ On determining the on-line minimax linear fit to a discrete point set in the plane ⋮ An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case ⋮ A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons ⋮ Optimal parallel algorithms for computing convex hulls and for sorting ⋮ Analytical models for locating undesirable facilities ⋮ \(\alpha\)-kernel problem with fuzzy visibility ⋮ On geometric automata which can nondeterministically choose auxiliary points ⋮ Euclidean geometry in terms of automata theory ⋮ Voronoi diagrams from convex hulls ⋮ On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination ⋮ A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff ⋮ A note on finding convex hulls via maximal vectors ⋮ Finding efficient solutions for rectilinear distance location problems efficiently ⋮ How to reduce the average complexity of convex hull finding algorithms ⋮ A space-optimal solution of general region location ⋮ Computational geometry in a curved world ⋮ Maintenance of configurations in the plane ⋮ Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays ⋮ Computing the convex hull in a hammock ⋮ Detecting the intersection of convex objects in the plane ⋮ On polyhedra induced by point sets in space ⋮ Optimal parallel algorithms for point-set and polygon problems ⋮ A heuristic for Euclidean and rectilinear Steiner problems ⋮ Constructing the Voronoi diagram of a set of line segments in parallel ⋮ The complexity of linear programming ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ An application of pattern matching to a problem in geometrical complexity ⋮ Computing simple circuits from a set of line segments ⋮ A characterization of nearest-neighbor rule decision surfaces and a new approach to generate them ⋮ An improved algorithm to check for polygon similarity ⋮ The all nearest-neighbor problem for convex polygons ⋮ Some remarks on the Steiner problem ⋮ A fast convex hull algorithm ⋮ A note on the graph isomorphism counting problem ⋮ Finding the intersection of two convex polyhedra ⋮ Divide and conquer for linear expected time ⋮ A note on Rabin's nearest-neighbor algorithm ⋮ Space sweep solves intersection of convex polyhedra ⋮ A unifying approach for a class of problems in the computational geometry of polygons ⋮ Vehicle routing with a sparse feasibility graph ⋮ Minimum vertex distance between separable convex polygons ⋮ An optimal algorithm for constructing the weighted Voronoi diagram in the plane ⋮ Dominance Product and High-Dimensional Closest Pair under L_infty ⋮ Some dynamic computational geometry problems
This page was built for publication:
