Probing the arrangement of hyperplanes (Q1842647): Difference between revisions
From MaRDI portal
Latest revision as of 13:15, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Probing the arrangement of hyperplanes |
scientific article |
Statements
Probing the arrangement of hyperplanes (English)
0 references
4 May 1995
0 references
The paper contains results about the combinatorial complexity of the geometry and topology related to an arrangement \(H\) of hyperplanes, obtained by the operation of ``probing'' by a flat \(F\) (using the respective intersection of \(H\) and \(F)\). In particular, the worst-case number of fixed direction line probes and those of flat probes to determine a generic line of \(H\) and \(H\) itself are obtained. Furthermore, interesting applications and connections to other areas are discussed, such as computational learning theory, networks of threshold functions, finger probing for polyhedral sets, robotics in general, and others.
0 references
arrangement of hyperplanes
0 references
probing
0 references
finger probing
0 references
treshold function
0 references
combinatorial complexity
0 references
robotics
0 references
0 references