Hervé Brönnimann

Publication Activity (10 Years)

Years Active: 1992-2010
Publications (10 Years): 0

Publications

Hüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis
Managing cohort movement of mobile sensors via GPS-free and compass-free node localization. J. Parallel Distributed Comput. 70 (7) (2010)
Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Hervé Brönnimann
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra. ICMS (2010)
Miroslav Ponec, Paul Giura, Joel Wein, Hervé Brönnimann
New payload attribution methods for network forensic investigations. ACM Trans. Inf. Syst. Secur. 13 (2) (2010)
Hüseyin Akcan, Alex Astashyn, Hervé Brönnimann
Deterministic algorithms for sampling count data. Data Knowl. Eng. 64 (2) (2008)
Hüseyin Akcan, Torsten Suel, Hervé Brönnimann
Geographic web usage estimation by monitoring DNS caches. LocWeb (2008)
Miroslav Ponec, Paul Giura, Hervé Brönnimann, Joel Wein
Highly efficient techniques for network forensics. CCS (2007)
Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
Lines Tangent to Four Triangles in Three-Dimensional Space. Discret. Comput. Geom. 37 (3) (2007)
Hüseyin Akcan, Hervé Brönnimann
A new deterministic data aggregation method for wireless sensor networks. Signal Process. 87 (12) (2007)
Hervé Brönnimann, Jonathan Lenchner, János Pach
Opposite-Quadrant Depth in the Plane. Graphs Comb. 23 (Supplement-1) (2007)
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37 (2) (2007)
Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
Cost prediction for ray shooting in octrees. Comput. Geom. 34 (3) (2006)
Sylvain Pion, Hervé Brönnimann, Guillaume Melquiond
A Proposal to add Interval Arithmetic to the C++ Standard Library. Reliable Implementation of Real Number Algorithms (2006)
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. SIAM J. Comput. 36 (3) (2006)
Hervé Brönnimann, Guillaume Melquiond, Sylvain Pion
The design of the Boost interval arithmetic library. Theor. Comput. Sci. 351 (1) (2006)
Hervé Brönnimann, Timothy M. Chan
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. 34 (2) (2006)
Hüseyin Akcan, Vassil Kriakov, Hervé Brönnimann, Alex Delis
GPS-Free node localization in mobile wireless sensor networks. MobiDE (2006)
Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
Minimum-Cost Coverage of Point Sets by Disks CoRR (2006)
Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey
Minimum-cost coverage of point sets by disks. SCG (2006)
Hüseyin Akcan, Hervé Brönnimann, Robert Marini
Practical and Efficient Geometric Epsilon-Approximations. CCCG (2006)
Hüseyin Akcan, Hervé Brönnimann
Deterministic Data Reduction in Sensor Networks. MASS (2006)
Hervé Brönnimann, Marc Glisse
Octrees with near optimal cost for ray-shooting. Comput. Geom. 34 (3) (2006)
Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
Cost-driven octree construction schemes: an experimental study. Comput. Geom. 31 (1-2) (2005)
Goce Trajcevski, Peter Scheuermann, Hervé Brönnimann, Agnès Voisard
Dynamic topological predicates and notifications in moving objects databases. Mobile Data Management (2005)
Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm. ALENEX/ANALCO (2005)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
Transversals to Line Segments in Three-Dimensional Space. Discret. Comput. Geom. 34 (3) (2005)
Jonathan Lenchner, Hervé Brönnimann
Observations and Computations in Sylvester-Gallai Theory. CCCG (2005)
Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon
Integrating Digital Forensics in Network Infrastructures. IFIP Int. Conf. Digital Forensics (2005)
Hervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram
String Matching on the Internet. CAAN (2004)
Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides
The number of lines tangent to arbitrary convex polyhedra in 3D. SCG (2004)
Hervé Brönnimann, Olivier Devillers, Sylvain Lazard, Frank Sottile
On the number of line tangents to four triangles in three-dimensional space. CCCG (2004)
Kulesh Shanmugasundaram, Hervé Brönnimann, Nasir D. Memon
Payload attribution via hierarchical bloom filters. CCS (2004)
Hervé Brönnimann, Timothy M. Chan, Eric Y. Chen
Towards in-place geometric algorithms and data structures. SCG (2004)
Goce Trajcevski, Peter Scheuermann, Hervé Brönnimann
Mission-critical management of mobile sensors: or, how to guide a flock of sensors. DMSN (2004)
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)
Hervé Brönnimann, Marc Glisse
Cost-Optimal Trees for Ray Shooting. LATIN (2004)
Hervé Brönnimann
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane. JCDCG (2004)
Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
Space-efficient planar convex hull algorithms. Theor. Comput. Sci. 321 (1) (2004)
Hervé Brönnimann, Bin Chen, Manoranjan Dash, Peter J. Haas, Peter Scheuermann
Efficient data reduction with EASE. KDD (2003)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
. CCCG (2003)
Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
Cost-driven octree construction schemes: an experimental study. SCG (2003)
Kulesh Shanmugasundaram, Nasir D. Memon, Anubhav Savant, Hervé Brönnimann
ForNet: A Distributed Forensics Network. MMM-ACNS (2003)
Hervé Brönnimann, Frédéric Cazals, Marianne Durand
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure. STACS (2003)
Hervé Brönnimann, Hazel Everett, Sylvain Lazard, Frank Sottile, Sue Whitesides
The number of transversals to line segments in R^3 CoRR (2003)
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)
Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, Godfried T. Toussaint
In-Place Planar Convex Hull Algorithms. LATIN (2002)
Hervé Brönnimann, Marc Glisse, David R. Wood
Cost-optimal quadtrees for ray shooting. CCCG (2002)
Boris Aronov, Hervé Brönnimann, Allen Y. Chang, Yi-Jen Chiang
Cost prediction for ray shooting. SCG (2002)
Hervé Brönnimann
Designing and Implementing a General Purpose Halfedge Data Structure. WAE (2001)
Hervé Brönnimann, Christoph Burnikel, Sylvain Pion
Interval arithmetic yields efficient dynamic filters for computational geometry. Discret. Appl. Math. 109 (1-2) (2001)
Boris Aronov, Hervé Brönnimann, Dan Halperin, Robert Schiffenbauer
On the Number of Views of Polyhedral Scenes. JCDCG (2000)
Hervé Brönnimann, Mariette Yvinec
Efficient Exact Evaluation of Signs of Determinants. Algorithmica 27 (1) (2000)
Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28 (5) (1999)
Hervé Brönnimann, Olivier Devillers
The union of unit balls has quadratic complexity, even if they all contain the origin CoRR (1999)
Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion
Sign Determination in Residue Number Systems. Theor. Comput. Sci. 210 (1) (1999)
Hervé Brönnimann
Degenerate Convex Hulls On-Line in Any Fixed Dimension. Discret. Comput. Geom. 22 (4) (1999)
Hervé Brönnimann
Degenerate Convex Hulls On-Line in Any Fixed Dimension. SCG (1998)
Hervé Brönnimann, Bernard Chazelle
Optimal slope selection via cuttings. Comput. Geom. 10 (1) (1998)
Hervé Brönnimann, Lutz Kettner, Stefan Schirra, Remco C. Veltkamp
Applications of the Generic Programming Paradigm in the Design of CGAL. Generic Programming (1998)
Hervé Brönnimann, Christoph Burnikel, Sylvain Pion
Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. SCG (1998)
Hervé Brönnimann, Ioannis Z. Emiris, Victor Y. Pan, Sylvain Pion
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision. SCG (1997)
Hervé Brönnimann, Mariette Yvinec
Efficient Exact Evaluation of Signs of Determinants. SCG (1997)
Hervé Brönnimann, Michael T. Goodrich
Almost Optimal Set Covers in Finite VC-Dimension. Discret. Comput. Geom. 14 (4) (1995)
Hervé Brönnimann, Michael T. Goodrich
Almost Optimal Set Covers in Finite VC-Dimension (Preliminary Version). SCG (1994)
Hervé Brönnimann
Almost Optimal Polyhedral Separators. SCG (1994)
Hervé Brönnimann, Bernard Chazelle
Optimal Slope Selection Via Cuttings. CCCG (1994)
Hervé Brönnimann, Bernard Chazelle, János Pach
How Hard Is Half-Space Range Searching. Discret. Comput. Geom. 10 (1993)
Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
Product Range Spaces, Sensitive Sampling, and Derandomization FOCS (1993)
Hervé Brönnimann, Bernard Chazelle
How Hard is Halfspace Range Searching? SCG (1992)