scientific article; zbMATH DE number 1391661
From MaRDI portal
Publication:4936005
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
(45)- scientific article; zbMATH DE number 1813012 (Why is no real title available?)
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Computation of spatial skyline points
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
- scientific article; zbMATH DE number 795220 (Why is no real title available?)
- Effective lattice point counting in rational convex polytopes
- A stochastic game framework for patrolling a border
- Improved bounds for guarding plane graphs with edges
- An analytical representation of the 2d generalized balanced power diagram
- The art gallery theorem, revisited
- Reflective guarding a gallery
- Geometric data structures for computer graphics.
- scientific article; zbMATH DE number 53528 (Why is no real title available?)
- Visibility extension via reflection
- Far-field reflector problem and intersection of paraboloids
- On the computation of Kantorovich-Wasserstein distances between two-dimensional histograms by uncapacitated minimum cost flows
- 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
- Experimental study on approximation algorithms for guarding sets of line segments
- Local geometric spanners
- Algorithms, Architectures and Information Systems Security
- Inner and outer approximations of polytopes using boxes.
- Line-segment intersection made in-place
- 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
- 3D rectangulations and geometric matrix multiplication
- Affine invariants of generalized polygons and matching under affine transformations
- Verification of Closest Pair of Points Algorithms
- A Euclid style algorithm for MacMahon's partition analysis
- Guarding Exterior Region of a Simple Polygon
- scientific article; zbMATH DE number 1703557 (Why is no real title available?)
- The orthogonal art gallery theorem with constrained guards
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- Closed-form characterization of the Minkowski sum and difference of two ellipsoids
- Lexicographic -robustness: an application to the 1-median problem
- Large eddy simulation of the wind flow in a realistic full-scale urban community with a scalable parallel algorithm
- Honey-pot constrained searching with local sensory information
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
- scientific article; zbMATH DE number 6176667 (Why is no real title available?)
- Navigating weighted regions with scattered skinny tetrahedra
- 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)
