scientific article; zbMATH DE number 1383707

MaRDI QIDQ4719331zbMATH OpenFDO

Authors Nora H. Sleumer

Publication date 24 January 2002

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Recommendations

• Output-sensitive cell enumeration in hyperplane arrangements
• Cell complexities in hyperplane arrangements
• A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
• On the sum of squares of cell complexities in hyperplane arrangements
• The complexity of many cells in arrangements of planes and related problems
• Enumerating regular mixed-cell configurations
• On the enumeration of a certain type of hyperplane arrangements
• Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
• Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
• Hyperplane arrangements: computations and conjectures

Cited in

(18)

• Reachability determination in acyclic Petri nets by cell enumeration approach
• On duality gap in binary quadratic programming
• A polynomial case of convex integer quadratic programming problems with box integer constraints
• A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
• A note on hyperplane generation
• Computing characteristic polynomials of hyperplane arrangements with symmetries
• Output-sensitive cell enumeration in hyperplane arrangements
• On zero duality gap in nonconvex quadratic programming problems
• Minimizing cubic and homogeneous polynomials over integers in the plane
• Enumerating regular mixed-cell configurations
• Partial identification in nonseparable binary response models with endogenous regressors
• Hyperplane arrangements in \texttt{polymake}
• On reduction of duality gap in quadratic knapsack problems
• A polynomial case of the cardinality-constrained quadratic optimization problem
• A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
• Cell-and-bound algorithm for chance constrained programs with discrete distributions
• A class of optimization problems motivated by rank estimators in robust regression
• Improved estimation of duality gap in binary quadratic programming using a weighted distance measure

Describes a project that uses

Uses Software

• cdd
• ZRAM

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 Q4719331)