Visas 1 - 10 av 11 resultat för sökning '"Computational geometry."', Sökningstid: 0,36s Förfina resultatet
  1. 1

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

    Artikel

    Approximate center points in dense point sets.
  2. 2

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

    Artikel

    Note on shortest and nearest lattice vendors.
  3. 3

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

    Artikel

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

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

    Artikel

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

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

    Artikel

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

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

    Artikel

    Algorithms for deciding the containment of polygons.
  7. 7

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

    Artikel

    Inscribing a symmetric body in an ellipse.
  8. 8

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

    I publikationen Journal of the ACM
    Artikel

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

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

    I publikationen Journal of the ACM
    Artikel

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

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

    I publikationen SIAM journal on computing.
    Artikel

    Ray shooting amidst spheres in three dimensions and related problems.

Sökverktyg: