Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
axis-aligned boxes
Description:
Geometric boxes whose edges are parallel to the coordinate axes, studied in computational and discrete geometry.
Primary topic:
Computational Geometry and Mesh Generation (42%)
Related topics:
Computational Geometry and Mesh Generation (42%),
Advanced Graph Theory Research (12%)
OpenAlex ID:
keywords/axis-aligned-boxes
Estimation theory for nonlinear models and set membership uncertainty
1991
·
M. Milanese
, A. Vicino
·
Automatica
·
112
On the complexity of learning from counterexamples
1989
·
W. Maass
, G. Turan
·
Annual Symposium on Foundations of Computer Science
·
68
Fast Path Planning Through Large Collections of Safe Boxes
2024
·
Tobia Marcucci
, Parth Nobel
, et al.
·
IEEE Transactions on Robotics
·
67
PDF
Box-Trees and R-Trees with Near-Optimal Query Time
2002
·
Agarwal
, de Berg
, et al.
·
Discrete & Computational Geometry
·
65
PDF
State Estimation Using Interval Analysis and Belief-Function Theory: Application to Dynamic Vehicle Localization
2009
·
Ghalia Nassreddine
, Fahed Abdallah
, et al.
·
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)
·
63
Tight Hardness Results for Maximum Weight Rectangles
2016
·
Backurs, Arturs
, Dikkala, Nishanth
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
58
PDF
Online Discrepancy Minimization for Stochastic Arrivals
2021
·
Nikhil Bansal
, Haotian Jiang
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
44
PDF
Tighter Bounds for the Discrepancy of Boxes and Polytopes
2017
·
Aleksandar Nikolov
·
Mathematika
·
41
PDF
On Klee's measure problem for grounded boxes
2012
·
Hakan Yildiz
, Subhash Suri
·
Annual Symposium on Computational Geometry (SoCG)
·
40
Better bounds for poset dimension and boxicity
2019
·
Alex Scott
, David R. Wood
·
Transactions of the American Mathematical Society
·
39
PDF
Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem
1994
·
Nina Amenta
·
Annual Symposium on Computational Geometry (SoCG)
·
37
PDF
Maximum-weight planar boxes in time (and better)
2014
·
Jérémy Barbay
, Timothy M. Chan
, et al.
·
Information Processing Letters
·
35
Bringing Order to Special Cases of Klee’s Measure Problem
2013
·
Karl Bringmann
·
Lecture notes in computer science
·
33
Box-trees and R-trees with near-optimal query time
2001
·
Pankaj K. Agarwal
, Mark de Berg
, et al.
·
Annual Symposium on Computational Geometry (SoCG)
·
31
Box-trees for collision checking in industrial installations
2002
·
Herman J. Haverkort
, Mark de Berg
, et al.
·
Annual Symposium on Computational Geometry (SoCG)
·
30
A note on minimal dispersion of point sets in the unit cube
2017
·
Jakub Sosnovec
·
European Journal of Combinatorics
·
29
Separating Pairs of Points by Standard Boxes
1985
·
Noga Alon
, Z. Füredi
, et al.
·
European Journal of Combinatorics
·
28
PDF
Multiple-Instance Learning of Real-Valued Geometric Patterns
2003
·
Sally A. Goldman
, Stephen D. Scott
·
Annals of Mathematics and Artificial Intelligence
·
26
On the dispersion of sparse grids
2017
·
David Krieg
·
Journal of Complexity
·
24
PDF
On Faster Sphere-Box Overlap Testing
2007
·
Thomas Larsson
, Tomas Akenine-Möller
, et al.
·
Journal of Graphics Tools
·
24
On Representing Graphs by Touching Cuboids
2013
·
David Bremner
, William Evans
, et al.
·
Lecture notes in computer science
·
23
On Comparable Box Dimension
2022
·
Dvořák, Zdeněk
, Gonçalves, Daniel
, et al.
·
Repository KITopen (Karlsruhe Institute of Technology)
·
21
PDF
All-Pairs Shortest Paths in Geometric Intersection Graphs
2019
·
Chan, Timothy M.
, Skrepetos, Dimitrios
·
Journal of computational geometry
·
21
Covering points by disjoint boxes with outliers
2010
·
Hee-Kap Ahn
, Sang Won Bae
, et al.
·
Computational Geometry
·
21
PDF
Covering with Euclidean Boxes
1987
·
Imre Bárány
, Jenö Lehel
·
European Journal of Combinatorics
·
20
Show more works
View as search
Works count:
127
Citation count:
1,394
Year
Topic
Type