Dangos 1 - 10 canlyniadau o 11 ar gyfer chwilio '"Computational geometry."', amser ymholiad: 0.12e Mireinio'r Canlyniadau
  1. 1

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

    Erthygl

    Approximate center points in dense point sets.
  2. 2

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

    Erthygl

    Note on shortest and nearest lattice vendors.
  3. 3

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

    Erthygl

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

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

    Erthygl

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

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

    Erthygl

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

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

    Erthygl

    Algorithms for deciding the containment of polygons.
  7. 7

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

    Erthygl

    Inscribing a symmetric body in an ellipse.
  8. 8

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

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

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

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

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

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

    Erthygl

    Ray shooting amidst spheres in three dimensions and related problems.

Offerynnau Chwilio: