| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Hervé Brönnimann Hervé Brönnimann, Timothy M. Chan : Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time. LATIN 2004 : 162-171 Hervé Brönnimann, Marc Glisse : Cost-Optimal Trees for Ray Shooting. LATIN 2004 : 349-358 Hervé Brönnimann, Hazel Everett , Sylvain Lazard , Frank Sottile , Sue Whitesides : Transversals to line segments in R 3 . CCCG 2003 : 174-177 Hervé Brönnimann, Bin Chen , Manoranjan Dash , Peter J. Haas , Peter Scheuermann : Efficient data reduction with EASE. KDD 2003 : 59-68 Kulesh Shanmugasundaram , Nasir D. Memon , Anubhav Savant , Hervé Brönnimann: ForNet: A Distributed Forensics Network. MMM-ACNS 2003 : 1-16 Hervé Brönnimann, Frédéric Cazals , Marianne Durand : Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. STACS 2003 : 283-294 Boris Aronov , Hervé Brönnimann, Allen Y. Chang , Yi-Jen Chiang : Cost-driven octree construction schemes: an experimental study. Symposium on Computational Geometry 2003 : 227-236 Hervé Brönnimann, Marc Glisse , David R. Wood : Cost-optimal quadtrees for ray shooting. CCCG 2002 : 109-112 Hervé Brönnimann, Olivier Devillers , Vida Dujmovic , Hazel Everett , Marc Glisse , Xavier Goaoc , Sylvain Lazard , Hyeon-Suk Na , Sue Whitesides : On the number of lines tangent to four convex polyhedra. CCCG 2002 : 113-117 Hervé Brönnimann, John Iacono , Jyrki Katajainen , Pat Morin , Jason Morrison , Godfried T. Toussaint : In-Place Planar Convex Hull Algorithms. LATIN 2002 : 494-507 Boris Aronov , Hervé Brönnimann, Allen Y. Chang , Yi-Jen Chiang : Cost prediction for ray shooting. Symposium on Computational Geometry 2002 : 293-302 Hervé Brönnimann: Designing and Implementing a General Purpose Halfedge Data Structure. Algorithm Engineering 2001 : 51-66 Hervé Brönnimann, Christoph Burnikel , Sylvain Pion : Interval arithmetic yields efficient dynamic filters for computational geometry. Discrete Applied Mathematics 109 (1-2): 25-47 (2001) Boris Aronov , Hervé Brönnimann, Dan Halperin , Robert Schiffenbauer : On the Number of Views of Polyhedral Scenes. JCDCG 2000 : 81-90 Hervé Brönnimann, Mariette Yvinec : Efficient Exact Evaluation of Signs of Determinants. Algorithmica 27 (1): 21-56 (2000) Hervé Brönnimann: Degenerate Convex Hulls On-Line in Any Fixed Dimension. Discrete & Computational Geometry 22 (4): 527-545 (1999) Hervé Brönnimann, Bernard Chazelle , Jirí Matousek : Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28 (5): 1552-1575 (1999) Hervé Brönnimann, Ioannis Z. Emiris , Victor Y. Pan , Sylvain Pion : Sign Determination in Residue Number Systems. Theor. Comput. Sci. 210 (1): 173-197 (1999) Hervé Brönnimann, Lutz Kettner , Stefan Schirra , Remco C. Veltkamp : Applications of the Generic Programming Paradigm in the Design of CGAL. Generic Programming 1998 : 206-217 Hervé Brönnimann, Christoph Burnikel , Sylvain Pion : Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. Symposium on Computational Geometry 1998 : 165-174 Hervé Brönnimann: Degenerate Convex Hulls On-Line in Any Fixed Dimension. Symposium on Computational Geometry 1998 : 249-258 Hervé Brönnimann, Bernard Chazelle : Optimal slope selection via cuttings. Comput. Geom. 10 (1): 23-29 (1998) Hervé Brönnimann, Mariette Yvinec : Efficient Exact Evaluation of Signs of Determinants. Symposium on Computational Geometry 1997 : 166-173 Hervé Brönnimann, Ioannis Z. Emiris , Victor Y. Pan , Sylvain Pion : Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. Symposium on Computational Geometry 1997 : 174-182 Hervé Brönnimann, Michael T. Goodrich : Almost Optimal Set Covers in Finite VC-Dimension. Discrete & Computational Geometry 14 (4): 463-479 (1995) Hervé Brönnimann, Bernard Chazelle : Optimal Slope Selection Via Cuttings. CCCG 1994 : 99-103 Hervé Brönnimann, Michael T. Goodrich : Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). Symposium on Computational Geometry 1994 : 293-302 Hervé Brönnimann: Almost Optimal Polyhedral Separators. Symposium on Computational Geometry 1994 : 393-394 Hervé Brönnimann, Bernard Chazelle , Jirí Matousek : Product Range Spaces, Sensitive Sampling, and Derandomization FOCS 1993 : 400-409 Hervé Brönnimann, Bernard Chazelle , János Pach : How Hard Is Half-Space Range Searching. Discrete & Computational Geometry 10 : 143-155 (1993) Hervé Brönnimann, Bernard Chazelle : How Hard is Halfspace Range Searching? Symposium on Computational Geometry 1992 : 271-275 1 [ 18 ] [ 21 ] [ 25 ] 2 [ 12 ] [ 19 ] 3 [ 26 ] 4 [ 31 ] 5 [ 21 ] [ 25 ] 6 [ 1 ] [ 2 ] [ 3 ] [ 6 ] [ 10 ] [ 15 ] 7 [ 28 ] 8 [ 21 ] [ 25 ] 9 [ 28 ] 10 [ 23 ] 11 [ 23 ] 12 [ 26 ] 13 [ 8 ] [ 14 ] 14 [ 23 ] [ 29 ] 15 [ 23 ] [ 24 ] [ 30 ] 16 [ 23 ] 17 [ 5 ] [ 7 ] 18 [ 28 ] 19 [ 18 ] 20 [ 22 ] 21 [ 22 ] 22 [ 13 ] 23 [ 23 ] [ 29 ] 24 [ 3 ] [ 15 ] 25 [ 27 ] 26 [ 22 ] 27 [ 22 ] 28 [ 23 ] 29 [ 2 ] 30 [ 8 ] [ 14 ] 31 [ 8 ] [ 12 ] [ 14 ] [ 19 ] 32 [ 27 ] 33 [ 28 ] 34 [ 18 ] 35 [ 13 ] 36 [ 27 ] 37 [ 29 ] 38 [ 22 ] 39 [ 13 ] 40 [ 23 ] [ 29 ] 41 [ 24 ] 42 [ 9 ] [ 17 ]  ©2004 Association for Computing Machinery |
