scientific article; zbMATH DE number 1391661
zbMATH Open0930.65001MaRDI QIDQ4936005FDOQ4936005
Author name not available (Why is that?)
Publication date: 20 January 2000
Title of this publication is not available (Why is that?)
Recommendations
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to numerical analysis (65-06) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to numerical analysis (65-00)
Cited In (43)
- Title not available (Why is that?)
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
- Title not available (Why is that?)
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows
- Computation of spatial skyline points
- A stochastic game framework for patrolling a border
- Effective lattice point counting in rational convex polytopes
- An analytical representation of the 2d generalized balanced power diagram
- Improved bounds for guarding plane graphs with edges
- Reflective guarding a gallery
- Navigating Weighted Regions with Scattered Skinny Tetrahedra
- Geometric data structures for computer graphics.
- Far-field reflector problem and intersection of paraboloids
- Guard placement for maximizing L-visibility exterior to a convex polygon
- Approximate guarding of monotone and rectilinear polygons
- The lockmaster's problem
- Shortest monotone descent path problem in polyhedral terrain
- Algorithms, Architectures and Information Systems Security
- Local geometric spanners
- Line-segment intersection made in-place
- Inner and outer approximations of polytopes using boxes.
- Optimal 2-coverage of a polygonal region in a sensor network
- Improved bounds for guarding plane graphs with edges
- Improved stretch factor of Delaunay triangulations of points in convex position
- 3D rectangulations and geometric matrix multiplication
- Constructive Polynomial Partitioning for Algebraic Curves in $\mathbb{R}^3$ with Applications
- Verification of Closest Pair of Points Algorithms
- Affine invariants of generalized polygons and matching under affine transformations
- Guarding Exterior Region of a Simple Polygon
- A Euclid style algorithm for MacMahon's partition analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments
- Title not available (Why is that?)
- Lexicographic \(\alpha\)-robustness: an application to the 1-median problem
- Closed-form characterization of the Minkowski sum and difference of two ellipsoids
- Large eddy simulation of the wind flow in a realistic full-scale urban community with a scalable parallel algorithm
- The orthogonal art gallery theorem with constrained guards
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
- 3D Rectangulations and Geometric Matrix Multiplication
- Title not available (Why is that?)
- Honey-pot constrained searching with local sensory information
- An approximation algorithm for the longest path problem in solid grid graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4936005)
