The Experts below are selected from a list of 18 Experts worldwide ranked by ideXlab platform

Joachim Gudmundsson - One of the best experts on this subject based on the ideXlab platform.

  • Symposium on Computational Geometry - Box-trees for collision checking in industrial installations
    Proceedings of the eighteenth annual symposium on Computational geometry - SCG '02, 2002
    Co-Authors: Herman Haverkort, Mark De Berg, Joachim Gudmundsson
    Abstract:

    A Box-tree is a bounding-volume hierarchy that uses axis-aligned Boxes as bounding volumes. We describe a new algorithm to construct a Box-tree for a 3D scene consisting of n objects, and we analyze its worst-case query time for approximate range queries. If the input scene has certain characteristics that we derived from our application---collision detection in industrial installations---then the query times are polylogarithmic, not only for searching with Boxes but also for range searching with other constant-complexity ranges.

Herman Haverkort - One of the best experts on this subject based on the ideXlab platform.

  • Symposium on Computational Geometry - Box-trees for collision checking in industrial installations
    Proceedings of the eighteenth annual symposium on Computational geometry - SCG '02, 2002
    Co-Authors: Herman Haverkort, Mark De Berg, Joachim Gudmundsson
    Abstract:

    A Box-tree is a bounding-volume hierarchy that uses axis-aligned Boxes as bounding volumes. We describe a new algorithm to construct a Box-tree for a 3D scene consisting of n objects, and we analyze its worst-case query time for approximate range queries. If the input scene has certain characteristics that we derived from our application---collision detection in industrial installations---then the query times are polylogarithmic, not only for searching with Boxes but also for range searching with other constant-complexity ranges.

Ana M. Rodríguez - One of the best experts on this subject based on the ideXlab platform.

  • Polynuclear Complexes Containing Ditopic Bispyrazolylmethane Ligands. Influence of Metal Geometry and Supramolecular Interactions
    Crystal Growth & Design, 2012
    Co-Authors: M. Carmen Carrión, Gema Durá, Félix A. Jalón, Blanca R. Manzano, Ana M. Rodríguez
    Abstract:

    The new ligands bis(pyrazol-1-yl)(pyridine-4-yl)methane (bpzm4py) (L1) and bis(3,5-dimethylpyrazol-1-yl)(pyridine-4-yl)methane (bpz*m4py) (L2) were synthesized and were made to react with different metallic starting materials. In the case of Pd(II), chloride or allyl trinuclear complexes were synthesized, in which the central palladium is bonded to two ligands through the pyridine moiety. Mononuclear [Pd(allyl)L]X complexes were also isolated. On using other M(II) centers (M = Co, Ni, Zn), which could adopt an octahedral Geometry, Box-like cyclic dimers formed by the self-assembly of two metal centers and two ligands in a head-to-tail disposition were obtained. All metal ions exhibited a distorted octahedral Geometry. A complex of Ag(I) with similar cyclic dimers connected through difluorophosphate anions to generate zigzag chains was also crystallized. The silver center was five-coordinate and the chain interactions gave rise to the formation of sheets. In the solid state, different noncovalent interacti...

Mark De Berg - One of the best experts on this subject based on the ideXlab platform.

  • Symposium on Computational Geometry - Box-trees for collision checking in industrial installations
    Proceedings of the eighteenth annual symposium on Computational geometry - SCG '02, 2002
    Co-Authors: Herman Haverkort, Mark De Berg, Joachim Gudmundsson
    Abstract:

    A Box-tree is a bounding-volume hierarchy that uses axis-aligned Boxes as bounding volumes. We describe a new algorithm to construct a Box-tree for a 3D scene consisting of n objects, and we analyze its worst-case query time for approximate range queries. If the input scene has certain characteristics that we derived from our application---collision detection in industrial installations---then the query times are polylogarithmic, not only for searching with Boxes but also for range searching with other constant-complexity ranges.

Fermín Otálora - One of the best experts on this subject based on the ideXlab platform.

  • Fractal trees and Horton's laws
    Mathematical Geology, 1992
    Co-Authors: Juan M. García-ruiz, Fermín Otálora
    Abstract:

    Fractal trees as a model for drainage systems are described in its generalized non-homogeneous form from the viewpoint of fractal Geometry. Box covering techniques are used to show the numerical equivalence between the Hausdorff-Besicovitch dimension and the similarity dimension of the fractally-dominant dust formed by the sources. In this way, the similarity relation D =log ( N )/log (1/ r ) is reinterpreted in terms of bifurcation and length ratio ( r _ B and r _ L ) as D =log ( r _ B )/log ( r _ L ). We test this relation for non-homogeneous exact fractal trees and two natural drainage systems. The fact that r _ B and r _ L are common parameters in quantitative geomorphology allows a trivial stimation of the fractal dimension of well-known drainage basins.