Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Non-partitionable point sets

From MaRDI portal
Publication:1058137
Jump to:navigation, search

DOI10.1016/0020-0190(84)90090-5zbMath0564.51007OpenAlexW2032139920MaRDI QIDQ1058137

David Avis

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90090-5


zbMATH Keywords

discrete mathematicsdata structurestrees\(\alpha(n)\)-partitionable


Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Data structures (68P05)


Related Items

Diameter partitioning ⋮ Hyperplane equipartitions plus constraints ⋮ A survey of mass partitions ⋮ Equipartition of mass distributions by hyperplanes ⋮ Topology of the Grünbaum–Hadwiger–Ramos hyperplane mass partition problem ⋮ Topology of the Grünbaum-Hadwiger-Ramos problem for mass assignments ⋮ Simplex Range Searching and Its Variants: A Review ⋮ Fair Division and Generalizations of Sperner- and KKM-type Results ⋮ Unnamed Item ⋮ Separating collections of points in Euclidean spaces ⋮ Equipartitions of measures in $\mathbb{R}^4$ ⋮ More bisections by hyperplane arrangements



Cites Work

  • Polygon Retrieval
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1058137&oldid=13080809"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 00:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki