@article{4000,
  abstract     = {We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler algorithms for low numbers of boxes. We use our implementations as engines to solve problems about geometric primitives. We look at two such problems in the category of quality analysis of surface triangulations.},
  author       = {Zomorodian, Afra and Edelsbrunner, Herbert},
  issn         = {0218-1959},
  journal      = {International Journal of Computational Geometry and Applications},
  number       = {1-2},
  pages        = {143 -- 172},
  publisher    = {World Scientific Publishing},
  title        = {{Fast software for box intersections}},
  doi          = {10.1142/S0218195902000785},
  volume       = {12},
  year         = {2002},
}

@article{4009,
  abstract     = {We study the maintenance of a simplicial grid or complex under changing density requirements. The proposed method works in any fixed dimension and generates grids by projecting cross-sections of a monotone simplicial complex that lives in one dimension higher than the grid. The density of the grid is adapted by locally moving the cross-section up or down along the extra dimension.},
  author       = {Edelsbrunner, Herbert and Waupotitsch, Roman},
  issn         = {0218-1959},
  journal      = {International Journal of Computational Geometry and Applications},
  number       = {3},
  pages        = {267 -- 284},
  publisher    = {World Scientific Publishing},
  title        = {{Adaptive simplicial grids from cross-sections of monotone complexes}},
  doi          = {10.1142/S0218195900000164},
  volume       = {10},
  year         = {2000},
}