Mostrando 1 - 10 Resultados de 11 Para Buscar '"Computational geometry."', tiempo de consulta: 0.10s Limitar resultados
  1. 1

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

    Artículo

    Approximate center points in dense point sets.
  2. 2

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

    Artículo

    Note on shortest and nearest lattice vendors.
  3. 3

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

    Artículo

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

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

    Artículo

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

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

    Artículo

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

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

    Artículo

    Algorithms for deciding the containment of polygons.
  7. 7

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

    Artículo

    Inscribing a symmetric body in an ellipse.
  8. 8

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

    Publicado en Journal of the ACM
    Artículo

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

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

    Publicado en Journal of the ACM
    Artículo

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

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

    Artículo

    Ray shooting amidst spheres in three dimensions and related problems.

Herramientas de búsqueda: