Algorithms for weak and wide separation of sets
type: Item
instance of: scholarly article
title: Algorithms for weak and wide separation of sets
zbMATH Open document ID: 0797.68160
DOI: 10.1016/0166-218X(93)90057-U
author: Michael E. Houle
published in: Discrete Applied Mathematics
publication date: 1994-10-19T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 428263
zbMATH Keywords: computational geometry
zbMATH Keywords: dual transform
zbMATH Keywords: arrangements
zbMATH Keywords: separation
zbMATH Keywords: pattern recognition
zbMATH Keywords: spherical separators
zbMATH Keywords: linear separators
MaRDI profile type: Publication
cites work: Q3796753
cites work: Q5583625
cites work: Voronoi diagrams from convex hulls
cites work: Partition of Space
cites work: Linear programming in \(O(n\times 3^{d^2})\) time
cites work: Enumeration of Seven-Argument Threshold Functions
cites work: A linear algorithm for determining the separation of convex polyhedra
cites work: Q4403756
cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
cites work: Computing the extreme distances between two convex polygons
cites work: Q3772828
cites work: Stabbing line segments
cites work: Constructing Arrangements of Lines and Hyperplanes with Applications
cites work: Voronoi diagrams and arrangements
cites work: Q5663020
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: Computing circular separability
description: scientific article; zbMATH DE number 428263