Computing the Arrangement of Circles on a Sphere, with Applications in Structural Biology (2009)
Cazals, Frederic, Loriot, Sebastien
Balls and spheres are the simplest modeling primitives after affine ones, which accounts for their ubiquitousness in Computer Science and Applied Mathematics. Amongst the many applications, we may...
Computing the Arrangement of Circles on a Sphere, with Applications in Structural Biology (2009)
Cazals, Frederic, Loriot, Sebastien
Balls and spheres are the simplest modeling primitives after affine ones, which accounts for their ubiquitousness in Computer Science and Applied Mathematics. Amongst the many applications, we may...
Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere (2009)
De Castro, Pedro, Cazals, Frederic, Loriot, Sebastien, Teillaud, Monique
This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non trivial predicates...
Design of the CGAL Spherical Kernel and application to arrangements of circles on a sphere (2009)
De Castro, Pedro, Cazals, Frederic, Loriot, Sebastien, Teillaud, Monique
This paper presents a CGAL kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non trivial predicates...
Loriot, Sebastien, Sachdeva, Sushant, Bastard, Karine, Prevost, Chantal, Cazals, Frederic
To address challenging flexible docking problems, a number of docking algorithms pre-generate large collections of candidate conformers. To remove the redundancy from such ensembles, a central...
Loriot, Sebastien, Sachdeva, Sushant, Bastard, Karine, Prevost, Chantal, Cazals, Frederic
To address challenging flexible docking problems, a number of docking algorithms pre-generate large collections of candidate conformers. To remove the redundancy from such ensembles, a central...
Robust and Efficient Delaunay triangulations of points on or close to a sphere (2009)
Caroli, Manuel, Loriot, Sebastien, Teillaud, Monique, Wormser, Camille
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed...
Robust and Efficient Delaunay triangulations of points on or close to a sphere (2009)
Caroli, Manuel, Loriot, Sebastien, Teillaud, Monique, Wormser, Camille
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed...
Robust and Efficient Delaunay triangulations of points on or close to a sphere (2009)
Caroli, Manuel, Loriot, Sebastien, Teillaud, Monique, Wormser, Camille
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed...
Robust and Efficient Delaunay triangulations of points on or close to a sphere (2009)
Caroli, Manuel, Loriot, Sebastien, Teillaud, Monique, Wormser, Camille
We propose two approaches for computing the Delaunay triangulation of points on a sphere, or of rounded points close to a sphere, both based on the classic incremental algorithm initially designed...
Computing the Volume of a Union of Balls: a Certified Algorithm (2009)
Cazals, Frederic, Harshad, Kanhere, Loriot, Sebastien
Balls and spheres are amongst the simplest 3D modeling primitives, and computing the volume of a union of balls is an elementary problem. Although a number of strategies addressing this problem have...
Computing the Volume of a Union of Balls: a Certified Algorithm (2009)
Cazals, Frederic, Harshad, Kanhere, Loriot, Sebastien
Balls and spheres are amongst the simplest 3D modeling primitives, and computing the volume of a union of balls is an elementary problem. Although a number of strategies addressing this problem have...
Modeling Macro-Molecular Interfaces with Intervor (2009)
Cazals, Frederic, Loriot, Sebastien
Intervor is a software computing a parameter free representation of macro-molecular interfaces, based on the alpha-complex of the atoms. Given two interacting partners, possibly with water molecules...
Modeling Macro-Molecular Interfaces with Intervor (2009)
Cazals, Frederic, Loriot, Sebastien
Intervor is a software computing a parameter free representation of macro-molecular interfaces, based on the alpha-complex of the atoms. Given two interacting partners, possibly with water molecules...
Loriot, Sebastien, Cazals, Frederic, Levitt, Michael, Bernauer, Julie
Knowledge-based protein folding potentials have proven successful in the recent years. Based on statistics of observed interatomic distances, they generally encode pairwise contact information. In...
Loriot, Sebastien, Cazals, Frederic, Levitt, Michael, Bernauer, Julie
Knowledge-based protein folding potentials have proven successful in the recent years. Based on statistics of observed interatomic distances, they generally encode pairwise contact information. In...
On the Characterization and Selection of Diverse Conformational Ensembles (2008)
Loriot, Sebastien, Sachdeva, Sushant, Bastard, Karine, Prevost, Chantal, Cazals, Frederic
As of today, a number of flexible docking experiments fail due to the lack of candidate conformations close from the bound ones. To tackle these difficult cases, which usually feature large...
On the Characterization and Selection of Diverse Conformational Ensembles (2008)
Loriot, Sebastien, Sachdeva, Sushant, Bastard, Karine, Prevost, Chantal, Cazals, Frederic
As of today, a number of flexible docking experiments fail due to the lack of candidate conformations close from the bound ones. To tackle these difficult cases, which usually feature large...
On the Characterization and Selection of Diverse Conformational Ensembles (2008)
Loriot, Sebastien, Sachdeva, Sushant, Bastard, Karine, Prevost, Chantal, Cazals, Frederic
As of today, a number of flexible docking experiments fail due to the lack of candidate conformations close from the bound ones. To tackle these difficult cases, which usually feature large...
On the Characterization and Selection of Diverse Conformational Ensembles (2008)
Loriot, Sebastien, Sachdeva, Sushant, Bastard, Karine, Prevost, Chantal, Cazals, Frederic
As of today, a number of flexible docking experiments fail due to the lack of candidate conformations close from the bound ones. To tackle these difficult cases, which usually feature large...
Depuis les travaux précurseurs de Richard et al., les constructions géométriques occupent une place importante dans la description des macro-molécules et leurs assemblages. En particulier,...
Depuis les travaux précurseurs de Richard et al., les constructions géométriques occupent une place importante dans la description des macro-molécules et leurs assemblages. En particulier,...
Depuis les travaux précurseurs de Richard et al., les constructions géométriques occupent une place importante dans la description des macro-molécules et leurs assemblages. En particulier,...
Depuis les travaux précurseurs de Richard et al., les constructions géométriques occupent une place importante dans la description des macro-molécules et leurs assemblages. En particulier,...
Cazals, Frederic, Loriot, Sebastien
Given a collection of circles on a sphere, we adapt the Bentley-Ottmann algorithm to the spherical setting to compute the {\em exact} arrangement of the circles. The algorithm consists of sweeping...
Cazals, Frederic, Loriot, Sebastien
Given a collection of circles on a sphere, we adapt the Bentley-Ottmann algorithm to the spherical setting to compute the {\em exact} arrangement of the circles. The algorithm consists of sweeping...
Cazals, Frederic, Loriot, Sebastien
Given a collection of circles in a sphere, we adapt the Bentley-Ottmann algorithm to the spherical setting to compute the {\em exact} arrangement of the circles. Assuming the circles are induced by...
Cazals, Frederic, Loriot, Sebastien
Given a collection of circles in a sphere, we adapt the Bentley-Ottmann algorithm to the spherical setting to compute the {\em exact} arrangement of the circles. Assuming the circles are induced by...
Cazals, Frederic, Loriot, Sebastien
Given a collection of circles in a sphere, we adapt the Bentley-Ottmann algorithm to the spherical setting to compute the {\em exact} arrangement of the circles. Assuming the circles are induced by...
Cazals, Frederic, Loriot, Sebastien
Given a collection of circles in a sphere, we adapt the Bentley-Ottmann algorithm to the spherical setting to compute the {\em exact} arrangement of the circles. Assuming the circles are induced by...