Đang hiển thị 1 - 10 kết quả của 11 cho tìm kiếm '"Computational geometry."', thời gian truy vấn: 0.10s Tinh chỉnh kết quả
  1. 1

    Approximate center points in dense point sets. Bằng Verbarg, Knut

    Bài viết

    Approximate center points in dense point sets.
  2. 2

    Note on shortest and nearest lattice vendors. Bằng Henk, Martin

    Bài viết

    Note on shortest and nearest lattice vendors.
  3. 3

    Finding a shortest Hamiltonian path inside a simple polygon. Bằng Alsuwaiyel, Muhammad H.

    Bài viết

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

    Hyperspherical neighbourhoods and pattern recognition using neural networks. Bằng Athitan, G.

    Bài viết

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

    Output-sensitive peeling of convex and maximal layers. Bằng Nielsen, Franck

    Bài viết

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

    Algorithms for deciding the containment of polygons. Bằng Barrera, Antonio Hernandez

    Bài viết

    Algorithms for deciding the containment of polygons.
  7. 7

    Inscribing a symmetric body in an ellipse. Bằng Santos, Francisco

    Bài viết

    Inscribing a symmetric body in an ellipse.
  8. 8

    Almost tight upper bounds for vertical decompositions in four dimensions. Bằng Koltun, Vladlen

    Xuất bản năm Journal of the ACM
    Bài viết

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

    Lenses in arrangements of pseudo-circles and their applications. Bằng Agarwal, Pankaj K.

    Xuất bản năm Journal of the ACM
    Bài viết

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

    Ray shooting amidst spheres in three dimensions and related problems. Bằng Mohaban, Shai

    Xuất bản năm SIAM journal on computing.
    Bài viết

    Ray shooting amidst spheres in three dimensions and related problems.

Công cụ tìm kiếm: