A mostrar 1 - 10 resultados de 11 para a pesquisa '"Computational geometry."', tempo de pesquisa: 0.05seg Refinar resultados
  1. 1

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

    Artigo

    Approximate center points in dense point sets.
  2. 2

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

    Artigo

    Note on shortest and nearest lattice vendors.
  3. 3

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

    Artigo

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

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

    Artigo

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

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

    Artigo

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

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

    Artigo

    Algorithms for deciding the containment of polygons.
  7. 7

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

    Artigo

    Inscribing a symmetric body in an ellipse.
  8. 8

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

    Publicado no Journal of the ACM
    Artigo

    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 no Journal of the ACM
    Artigo

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

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

    Artigo

    Ray shooting amidst spheres in three dimensions and related problems.

Ferramentas de pesquisa: