Please note that IST Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

6514 Publications


1989 | Journal Article | IST-REx-ID: 4080
Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose Many Points.” Geometriae Dedicata, vol. 32, no. 1, Kluwer, 1989, pp. 1–12, doi:10.1007/BF00181432.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4081
Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi:10.1007/BF02187733.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4082
Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” Journal of Computer and System Sciences, vol. 38, no. 1, Elsevier, 1989, pp. 165–94, doi:10.1016/0022-0000(89)90038-X.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4083
Yao, F., et al. “Partitioning Space for Range Queries.” SIAM Journal on Computing, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:10.1137/0218025.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4084
Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” Theoretical Computer Science, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:10.1016/0304-3975(89)90133-3.
View | DOI
 

1989 | Conference Paper | IST-REx-ID: 4085
Edelsbrunner, Herbert. An Acyclicity Theorem for Cell Complexes in d Dimension. ACM, 1989, pp. 145–51, doi:10.1145/73833.73850.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4086
Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” Discrete & Computational Geometry, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:10.1007/BF02187734.
View | DOI
 

1989 | Conference Paper | IST-REx-ID: 4087
Edelsbrunner, Herbert, et al. Tetrahedrizing Point Sets in Three Dimensions. Vol. 358, Springer, 1989, pp. 315–31, doi:10.1007/3-540-51084-2_31.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4088
Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.
View | DOI
 

1989 | Journal Article | IST-REx-ID: 4089
Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” Discrete & Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:10.1007/BF02187745.
View | DOI
 

Search

Filter Publications