Résultat(s) 1 - 10 résultats de 11 pour la requête '"Computational geometry."', Temps de recherche: 0,05s Affiner les résultats
  1. 1

    Approximate center points in dense point sets. par Verbarg, Knut

    Article

    Approximate center points in dense point sets.
  2. 2

    Note on shortest and nearest lattice vendors. par Henk, Martin

    Article

    Note on shortest and nearest lattice vendors.
  3. 3

    Finding a shortest Hamiltonian path inside a simple polygon. par Alsuwaiyel, Muhammad H.

    Article

    Finding a shortest Hamiltonian path inside a simple polygon.
  4. 4

    Hyperspherical neighbourhoods and pattern recognition using neural networks. par Athitan, G.

    Article

    Hyperspherical neighbourhoods and pattern recognition using neural networks.
  5. 5

    Output-sensitive peeling of convex and maximal layers. par Nielsen, Franck

    Article

    Output-sensitive peeling of convex and maximal layers.
  6. 6

    Algorithms for deciding the containment of polygons. par Barrera, Antonio Hernandez

    Article

    Algorithms for deciding the containment of polygons.
  7. 7

    Inscribing a symmetric body in an ellipse. par Santos, Francisco

    Article

    Inscribing a symmetric body in an ellipse.
  8. 8

    Almost tight upper bounds for vertical decompositions in four dimensions. par Koltun, Vladlen

    Publié dans Journal of the ACM
    Article

    Almost tight upper bounds for vertical decompositions in four dimensions.
  9. 9

    Lenses in arrangements of pseudo-circles and their applications. par Agarwal, Pankaj K.

    Publié dans Journal of the ACM
    Article

    Lenses in arrangements of pseudo-circles and their applications.
  10. 10

    Ray shooting amidst spheres in three dimensions and related problems. par Mohaban, Shai

    Article

    Ray shooting amidst spheres in three dimensions and related problems.

Outils de recherche: