Searching for authors named "Olivier Devillers" – sorted by Relevance.
83 documents found, showing 1 through 10.
Next 10 →
-
Simultaneous Containment Of Several Polygons: Analysis Of The Contact Configurations
- …The main concern of this paper is the detection of double contact configurations for some polygons moving in translation in a polygonal environment. We first establish some general properties about such configurations and give conditions of existence of double contacts for two or three objects. …
- Cited by 6 (0 self) – Add To MetaCart
-
Computational Geometry and Discrete Computations
- …In this talk we describe some problems arising in practical implementation of algorithms from computational geometry. Going to robust algorithms needs to solve issues such as rounding errors and degeneracies. Most of the problems are closely related to the incompatibility between on one side alg…
- Cited by 1 (1 self) – Add To MetaCart
-
Randomization Yields Simple O(n log* n) Algorithms for Difficult Ω(n) Problems
- …We use here the results on the influence graph to adapt them for particular cases where additional information is available. In some cases, it is possible to improve the expected randomized complexity of algorithms from O(n log n) to O(n log* n). This technique applies in the following applica…
- Cited by 13 (6 self) – Add To MetaCart
-
Robust and efficient implementation of the Delaunay tree
- …In this paper, we present some practical results concerning the imple- mentation of the algorithm described in [DMT] which computes dynami- cally the Delaunay triangulation of a set of sites in the plane in logarithmic expected update time.…
- Add To MetaCart
-
Robust and efficient implementation of the Delaunay tree
- …In this paper, we pr es ent s ome pr act i cal r es ul t s concer ni ng t he i mpl e - ment at i on of t he al gor i t hmdes cr i bed i n [DMT] whi ch comput es dynamicallytheDel aunay tr i angul at i on of a set of s i tes i n the pl ane i n l ogar i thmic expected update ti me. More preci sel y,we…
- Add To MetaCart
-
The Shuffling Buffer
- …This paper illustrates the shuffling buffer method for sorting and the Delaunay triangulation. However, we would like to point out that this kind of randomized technique is suitable in many other domains…
- Cited by 6 (0 self) – Add To MetaCart
-
Scalable Algorithms For Bichromatic Line Segment Intersection Problems On Coarse Grained Multicomputers
- …We present output-sensitive scalable parallel algorithms for bichromatic line segment intersection problems for the coarse grained multicomputer model. Under the assumption that n p 2 , where n is the number of line segments and p the number of processors, we obtain an intersection counting algorith…
- Cited by 17 (0 self) – Add To MetaCart
-
A Locally Optimal Triangulation of the Hyperbolic Paraboloid
- …Given a set S of data points in IR 2 and corresponding data values for a specic non-convex surface, the unit hyperbolic paraboloid, we consider the problem of nding a locally optimal triangulation of S for the linear approximation of this surface. The chosen optimality criterion will be the L 2 no…
- Cited by 7 (0 self) – Add To MetaCart
-
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems
- …In this paper, we discuss two variations of the two-dimensional postoffice problem that arise when the post-offices are n postmen moving with constant velocities. The first variation addresses the question: given a point q 0 and time t 0 who is the nearest postman to q 0 at time t 0 ?We present a ra…
- Cited by 6 (2 self) – Add To MetaCart
-
Progressive Lossless Compression of Arbitrary Simplicial Complexes
- …Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold or "nearly manifold". We propose here a progressive geometry compression scheme which can handle manifold models as well …
- Cited by 39 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
