scientific article; zbMATH DE number 1391661

From MaRDI portal
Publication:4936005

zbMath0930.65001MaRDI QIDQ4936005

No author found.

Publication date: 20 January 2000


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Computation of spatial skyline points, Verification of Closest Pair of Points Algorithms, Approximate guarding of monotone and rectilinear polygons, Far-field reflector problem and intersection of paraboloids, The lockmaster's problem, Line-segment intersection made in-place, Navigating Weighted Regions with Scattered Skinny Tetrahedra, Effective lattice point counting in rational convex polytopes, Affine invariants of generalized polygons and matching under affine transformations, Optimal 2-coverage of a polygonal region in a sensor network, Shortest monotone descent path problem in polyhedral terrain, 3D Rectangulations and Geometric Matrix Multiplication, Reflective guarding a gallery, A stochastic game framework for patrolling a border, 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids, Large eddy simulation of the wind flow in a realistic full-scale urban community with a scalable parallel algorithm, 3D rectangulations and geometric matrix multiplication, Inner and outer approximations of polytopes using boxes., Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications, A Euclid style algorithm for MacMahon's partition analysis, Improved bounds for guarding plane graphs with edges, Lexicographicα-robustness: an application to the 1-median problem, The orthogonal art gallery theorem with constrained guards, Honey-pot constrained searching with local sensory information, Guarding Exterior Region of a Simple Polygon, Unnamed Item, Closed-form characterization of the Minkowski sum and difference of two ellipsoids, GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA, Improved stretch factor of Delaunay triangulations of points in convex position, Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments, An approximation algorithm for the longest path problem in solid grid graphs, On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows, Local geometric spanners, GUARD PLACEMENT FOR MAXIMIZING L-VISIBILITY EXTERIOR TO A CONVEX POLYGON, Improved bounds for guarding plane graphs with edges