Topologically sweeping an arrangement
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3168302 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3744018 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3394958 (Why is no real title available?)
- Amortized Computational Complexity
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Decomposable searching problems I. Static-to-dynamic transformation
- Euclidean shortest paths in the presence of rectilinear barriers
- How good is the information theory bound in sorting?
- Konvexe Fünfecke in ebenen Punktmengen
- Optimal Point Location in a Monotone Subdivision
- Plane-sweep algorithms for intersecting geometric figures
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Sets with No Empty Convex 7-Gons
- The power of geometric duality
Cited in
(only showing first 100 items - show all)- Approximating finite weighted point sets by hyperplanes
- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining
- The onion diagram: a Voronoi-like tessellation of a planar line space and its applications
- Largest and smallest area triangles on imprecise points
- scientific article; zbMATH DE number 2081012 (Why is no real title available?)
- Finding minimum area \(k\)-gons
- On Combinatorial Depth Measures
- Locating an obnoxious plane
- Bottleneck convex subsets: finding k large convex sets in a point set
- Counting convex polygons in planar point sets
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- scientific article; zbMATH DE number 66691 (Why is no real title available?)
- A linear-time algorithm for constructing a circular visibility diagram
- LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies
- Convex polygons in Cartesian products
- Rounding Arrangements Dynamically
- Linear approximation of simple objects
- Reassembling polygons from edges
- Algorithms for deciding the containment of polygons
- Separability of imprecise points
- Partitioning arrangements of lines. II: Applications
- Separating and shattering long line segments
- Connected Rectilinear Graphs on Point Sets
- Computing pseudotriangulations via branched coverings
- scientific article; zbMATH DE number 7559262 (Why is no real title available?)
- Maximum-width rainbow-bisecting empty annulus
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Sorting jordan sequences in linear time using level-linked search trees
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
- Linear approximation of simple objects
- On triangulating three-dimensional polygons
- All-maximum and all-minimum problems under some measures
- The parameterized complexity of finding point sets with hereditary properties
- Complexity of computing interval matrix powers for special classes of matrices.
- The exact fitting problem in higher dimensions
- Submodular function minimization
- Polygon nesting and robustness
- A topology construction from line drawings using a uniform plane subdivision technique.
- FINDING POPULAR PLACES
- Output-sensitive cell enumeration in hyperplane arrangements
- Visibility graphs and obstacle-avoiding shortest paths
- Sweeping points
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
- Constructing arrangements optimally in parallel
- Line arrangements and range search
- TOPOLOGICAL PEELING AND APPLICATIONS
- On a class of O(n^2) problems in computational geometry
- Bottleneck partial-matching Voronoi diagrams and applications
- On the least trimmed squares estimator
- Combinatorial polar orderings and recursively orderable arrangements
- On some geometric optimization problems in layered manufacturing
- Finding Popular Places
- Taking a walk in a planar arrangement
- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
- Finding minimum area simple pentagons
- Space-efficient plane-sweep algorithms
- Regular systems of paths and families of convex sets in convex position
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- Searching for empty convex polygons
- scientific article; zbMATH DE number 1926667 (Why is no real title available?)
- Pattern matching in a digitized image
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Algorithms for colourful simplicial depth and medians in the plane
- Combinatorial complexity bounds for arrangements of curves and spheres
- Separating and shattering long line segments
- A practical approximation algorithm for the LMS line estimator
- scientific article; zbMATH DE number 49092 (Why is no real title available?)
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes
- The effect of planarization on width
- Implicitly representing arrangements of lines or segments
- scientific article; zbMATH DE number 176571 (Why is no real title available?)
- A unified scheme for detecting fundamental curves in binary edge images
- Asymptotic speed-ups in constructive solid geometry
- Better lower bounds on detecting affine and spherical degeneracies
- Sweep methods for parallel computational geometry
- MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT
- Topologically sweeping visibility complexes via pseudotriangulations
- On a class of \(O(n^ 2)\) problems in computational geometry
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE
- EXACT ALGORITHMS FOR CIRCLES ON THE SPHERE
- The maximin line problem with regional demand
- Scanline algorithms on a grid
- The complexity of cutting complexes
- Infimaximal Frames: A Technique for Making Lines Look Like Segments
- Monotone paths in line arrangements
- On the general motion-planning problem with two degrees of freedom
- Sweeping arrangements of non-piercing regions in the plane
- Shattering a set of objects in 2D
- Computing convolutions by reciprocal search
- Illumination by floodlights
- On the union of fat wedges and separating a collection of segments by a line
- Computational geometric approach to submodular function minimization for multiclass queueing systems
- Optimal and suboptimal robust algorithms for proximity graphs
- Iterated nearest neighbors and finding minimal polytopes
- THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS
- Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution
- Space sweep solves intersection of convex polyhedra
This page was built for publication: Topologically sweeping an arrangement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122981)
