Cutting Hyperplanes for Divide-and-Conquer.
Discrete & computational geometry (1993)
- Volume: 9, Issue: 2, page 145-158
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
top
How to cite
topChazelle, B.. "Cutting Hyperplanes for Divide-and-Conquer.." Discrete & computational geometry 9.2 (1993): 145-158. <http://eudml.org/doc/131240>.
@article{Chazelle1993,
author = {Chazelle, B.},
journal = {Discrete & computational geometry},
keywords = {computational geometry; hyperplane arrangement; cutting; simplex; divide- and-conquer; segment intersection; line/point incidence; linear programming; point location; epsilon-net; deterministic algorithm},
number = {2},
pages = {145-158},
title = {Cutting Hyperplanes for Divide-and-Conquer.},
url = {http://eudml.org/doc/131240},
volume = {9},
year = {1993},
}
TY - JOUR
AU - Chazelle, B.
TI - Cutting Hyperplanes for Divide-and-Conquer.
JO - Discrete & computational geometry
PY - 1993
VL - 9
IS - 2
SP - 145
EP - 158
KW - computational geometry; hyperplane arrangement; cutting; simplex; divide- and-conquer; segment intersection; line/point incidence; linear programming; point location; epsilon-net; deterministic algorithm
UR - http://eudml.org/doc/131240
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.