[go: up one dir, main page]

Fleischer et al., 1990 - Google Patents

On simultaneous inner and outer approximation of shapes

Fleischer et al., 1990

View PDF
Document ID
6188424409730633778
Author
Fleischer R
Mehlhorn K
Rote G
Welzl E
Yap C
Publication year
Publication venue
Proceedings of the sixth annual symposium on Computational geometry

External Links

Snippet

For compact Euclidean bodies P, Q, we define λ (P, Q) to be smallest ratio r/s where r> 0, s> 0 satisfy sQ′⊆ P⊆ rQ ″. Here sQ denotes a scaling of Q by factor s, and Q′, Q ″are some translates of Q. This function λ gives us a new distance function between bodies …
Continue reading at dl.acm.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/30—Arrangements for executing machine-instructions, e.g. instruction decode

Similar Documents

Publication Publication Date Title
Fleischer et al. On simultaneous inner and outer approximation of shapes
Horst On generalized bisection of 𝑛-simplices
Maillot A new, fast method for 2D polygon clipping: analysis and software implementation
US20140026107A1 (en) Method and system for optimal decomposition of single-qubit quantum circuits using standard quantum gates
Vavasis Stable finite elements for problems with wild coefficients
Bánhelyi et al. Optimal circle covering problems and their applications
Li et al. Incremental 3d collision detection with hierarchical data structures
Wortmann et al. Algorithmic complexity of shape grammar implementation
Tzemos et al. Origin of chaos near three-dimensional quantum vortices: A general Bohmian theory
US6489961B1 (en) Rasterization of lines in a cylindrical voxel grid
US7197486B2 (en) Optimization method with constraints and apparatus therefor
Chandran et al. A parallel algorithm for enclosed and enclosing triangles
Kain et al. Numerical shape-from-shading for discontinuous photographic images
Binucci et al. Labeling heuristics for orthogonal drawings
Spriggs et al. A new bound for map labeling with uniform circle pairs
Di Zenzo et al. A useful image representation
Chang et al. An Experiment Using LN for Exact Geometric Computations.
Zarrabi et al. Single-Point And Triple-Point Queries Visibility Constrained Minimum Link Paths In Simple Polygons.
van der Stappen et al. Efficient algorithms for exact motion planning amidst fat obstacles
Do et al. Efficient maximum matching algorithms for trapezoid graphs.
Slota et al. Scaling distributed graph processing to hundreds of GPUs
Ghasemi et al. An algorithmic framework for solving geometric covering problems—with applications
Wittenburg Polyhedral Cylinders Formed by Kokotsakis Meshes
Yagasaki Higher-order Melnikov method and chaos for two-degree-of-freedom Hamiltonian systems with saddle-centers
Kirklin et al. Singular cosmological instantons made regular