Mostra 1 - 10 risultati di 11 ricerca '"Computational geometry."', tempo di risposta: 0,23s Raffina i risultati
  1. 1

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

    Articolo

    Approximate center points in dense point sets.
  2. 2

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

    Articolo

    Note on shortest and nearest lattice vendors.
  3. 3

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

    Articolo

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

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

    Articolo

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

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

    Articolo

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

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

    Articolo

    Algorithms for deciding the containment of polygons.
  7. 7

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

    Articolo

    Inscribing a symmetric body in an ellipse.
  8. 8

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

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Pubblicato in Journal of the ACM
    Articolo

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

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

    Articolo

    Ray shooting amidst spheres in three dimensions and related problems.

Strumenti per la ricerca: