Nothing Special   »   [go: up one dir, main page]

Zarei et al., 2008 - Google Patents

Query point visibility computation in polygons with holes

Zarei et al., 2008

View PDF
Document ID
16833470048329986951
Author
Zarei A
Ghodsi M
Publication year
Publication venue
Computational Geometry

External Links

Snippet

In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. The goal is to perform this computation efficiently per query considering the cost of the preprocessing phase. Our algorithm is based on solutions in [ALP Bose, JI …
Continue reading at www.sciencedirect.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5086—Mechanical design, e.g. parametric or variational design
    • 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

Similar Documents

Publication Publication Date Title
Lien et al. Approximate convex decomposition of polygons
Armentano et al. Asymptotic lower bounds for eigenvalues by nonconforming finite element methods
Hershberger An optimal visibility graph algorithm for triangulated simple polygons
Zarei et al. Efficient computation of query point visibility in polygons with holes
Diestel et al. Duality theorems for blocks and tangles in graphs
Zarei et al. Query point visibility computation in polygons with holes
Brini et al. Rational reductions of the 2D-Toda hierarchy and mirror symmetry
Hols et al. Smaller parameters for vertex cover kernelization
Gao et al. Rational quadratic approximation to real algebraic curves
Bohler et al. A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams
Muller et al. Lower bound cluster algebras: presentations, Cohen–Macaulayness, and normality
Cheng et al. Adaptive point location in planar convex subdivisions
Inkulu et al. Planar rectilinear shortest path computation using corridors
Kulkarni et al. Dimension-reduction technique for polygons
Inkulu et al. Dynamic algorithms for visibility polygons in simple polygons
Kundu et al. K-nearest neighbour (KNN) approach using SAT based technique for rectilinear steiner tree construction
Vatter An Erd\H {o} s--Hajnal analogue for permutation classes
Sabharwal et al. A triangle-triangle intersection algorithm
Goyal et al. On dynamic optimality for binary search trees
Yang et al. Minimal tetrahedralizations of a class of polyhedra
Zarei et al. Maintaining Visibility Polygon of a Moving Point Observer in Polygons with Holes
Porembski Cutting planes for low-rank-like concave minimization problems
Hongguang et al. New Framework for Decomposing a Polygon with Zero or More Holes
Soldano Closed patterns and abstraction beyond lattices
Amato An optimal algorithm for finding the separation of simple polygons