- Submitted to Special issue of Theoret. Comput. Sci. on Real Numbers and Computers Exact modular arithmetic with single precision
- Designing and implementing a general purpose halfedge data structure Preliminary copy, do not distribute.
- Cost-Optimal Quadtrees for Ray Shooting Herv e Bronnimann y Marc Glisse y David R. Wood z
- Optimal Slope Selection Via Cuttings Herv' e Br onnimann Bernard Chazelle
- Almost Optimal Set Covers in Finite VCDimension Herv' e Br onnimann \Lambda
- On the Number of Lines Tangent to Four Convex Polyhedra H. Bronnimann y O. Devillers k V. Dujmovi c z H. Everett x M. Glisse { X. Goaoc x
- Transversals to line segments in three-dimensional space
- Deterministic Sampling beyond EASE: Reducing Multi-Dimensional Data
- CostOptimal Trees for Ray Shooting Herve Bronnimann 1# and Marc Glisse 2##
- On the number of line tangents to four triangles in threedimensional Herve Bronnimann + Olivier Devillers # Sylvain Lazard Frank Sottile
- Payload Attribution via Hierarchical Bloom Filters Shanmugasundaram
- Tangents to (various kinds of) objects in R3
- CostDriven Octree Construction Schemes: An Experimental Study #
- Submitted to Scientic Computing, Computer Arithmetic, and Validated Numerics (SCAN) 1997. Exact rounding for geometric constructions
- Engineering Herv Brnnimann
- Transversals to line segments in threedimensional space #
- Cost-Driven Octree Construction Schemes: An Experimental Study
- Deterministic Data Reduction in Sensor Networks Huseyin Akcan
- M'ethodes de d'erandomisation en g'eometrie Herv'e Bronnimann
- Efficient DataReduction Methods for OnLine Association Rule Discovery Herve Bronnimann a , Bin Chen b , Manoranjan Dash c , Peter Haas d , Yi Qiao c , Peter Scheuermann c
- Greedy online histograms applied to deterministic sampling
- An Exploration of the 3D Visibility Complex Leslie Glaves
- Implementation of Cost-Measure-based Octree Construction Algorithms.
- APPROXIMATION OF ICEBERG-CUBES USING DATA REDUCTION TECHNIQUES
- Herv Brnnimann Polytechnic University, Brooklyn NY, USA
- Herv Brnnimann Polytechnic University, Brooklyn NY, USA
- Efficient Data-Reduction Methods for On-Line Association Rule Discovery Herve Bronnimann
- Towards In-Place Geometric Algorithms and Data Structures Herve Bronnimann
- Counting and enumerating pseudo-triangulations with the greedy flip algorithm
- Lines tangent to four triangles in three-dimensional space H. Bronnimann,1
- In-Place Planar Convex Hull Algorithms Herve Bronnimann1
- Minimum-Cost Coverage of Point Sets by Disks Helmut Alt Esther M. Arkin Herve Bronnimann Jeff Erickson Sandor P. Fekete
- How to Water Carrots: Geometric Coverage Problems for Point Sets
- Observations and Computations in Sylvester-Gallai Theory Herve Bronnimann
- Efcient Data Reduction with EASE Bronnimann
- Designing and implementing a general purpose halfedge data structure
- Payload Attribution via HierarchicalPayload Attribution via Hierarchical Bloom FiltersBloom Filters
- Efficient Data-Reduction Methods for On-Line
- Cost Prediction for Ray Shooting Boris Aronov
- SPACE-EFFICIENT PLANAR CONVEX HULL ALGORITHMS Herv e Bronnimann y John Iacono y Jyrki Katajainen z Pat Morin x Jason Morrison x
- DETERMINISTIC DATA REDUCTION METHODS FOR TRANSACTIONAL DATA SETS
- Efficient DataReduction Methods for OnLine
- Towards Space-Efficient Geometric Algorithms
- Product Range Spaces, Sensitive Sampling, and Derandomization Herv' e Br onnimann \Lambda
- EOEcient Exact Evaluation of Signs of Determinants \Lambda Herv# Br#nnimann y Mariette Yvinec z
- Cost-Optimal Trees for Ray Shooting Herve Bronnimann1
- Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure ?
- Applications of the Generic Programming Paradigm in the Design of CGAL ?
- Interval Arithmetic Yields EOEcient Dynamic Filters for Computational Geometry \Lambda
- Cost Prediction for Ray Shooting in Octrees 1 Boris Aronov a
- Space Efficient Geometric Data Structures and Algorithms Space Efficient Geometric Data Structures
- Cost-Optimal Quadtrees for Ray Shooting Herve Bronnimann
- Space-efficient algorithms for computing the convex hull of a simple polygonal line
- Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
- Towards In-Place Geometric Algorithms and Data Structures Herv e Bronnimann Timothy M. Chan y Eric Y. Chen z
- Transversals to line segments in R 3 H. Bronnimann y H. Everett z S. Lazard z F. Sottile x S. Whitesides {
- Efcient Data Reduction with EASE Comp & Info Sci
- ON THE NUMBER OF EUCLIDEAN ORDINARY POINTS FOR LINES IN THE
- Octrees with near optimal cost for ray-shooting 1,3,4
- !#" $%'&)(10 2435#567"98A@ BDCFEHGPIRQSEHCFTUCWV
- Mission-Critical Management of Mobile Sensors (or, How to Guide a Flock of Sensors)
- On the number of line tangents to four triangles in three-dimensional Herve Bronnimann
- Techniques multi-resolution cooperatives pour l'analyse structurelle des os de la main
- egiEippsgsix vexe gyxi rvv evqysrw rerve fronnimnny
- Cost-Driven Octree Construction Schemes: An Experimental Study
- How to water carrots: geometric coverage
- How Hard Is Halfspace Range Searching? \Lambda Herv' e Br onnimann y Bernard Chazelle z J' anos Pach x
- Minimum-Cost Coverage of Point Sets by Disks Institute of Computer Science
- To appear in 13th Annual ACM Symposium on Computational Geometry, June 46 1997, Nice, France. Computing exact geometric predicates
- DERANDOMIZATION OF GEOMETRIC ALGORITHMS Herv'e Bronnimann
- The union of unit balls has quadratic complexity, even if they all contain the origin
- Degenerate convex hulls on-line in any xed Herv e Bronnimann
- MissionCritical Management of Mobile Sensors (or, How to Guide a Flock of Sensors)
- Space-efficient algorithms for computing the convex hull of a simple polygonal line
- The Number of Lines Tangent to Arbitrary Convex Polyhedra in 3D
- CostDriven Octree Construction Schemes: An Experimental Study
