The point of polygon problem for arbitrary polygons
From MaRDI portal
Recommendations
- Does a point lie inside a polygon ?
- Enhanced modified-polygon method for point-in-polygon problem
- Efficient algorithms for testing membership of a point in polygons and polyhedra
- scientific article; zbMATH DE number 2061057
- A robust method for calculating the simplicity and orientation of planar polygons
Cites work
Cited in
(34)- A robust method for calculating the simplicity and orientation of planar polygons
- Efficient algorithms for testing membership of a point in polygons and polyhedra
- A fast boundary integral equation method for point location problem
- Speed-up of the volumetric method of moments for the approximate RCS of large arbitrary-shaped dielectric targets
- On the numerical integration of trimmed isogeometric elements
- Does a point lie inside a polygon ?
- Spectrally accurate solutions to inhomogeneous elliptic PDE in smooth geometries using function intension
- Immersed boundary method for high-order flux reconstruction based on volume penalization
- InRS: implementing the indicator function of NURBS-shaped planar domains
- Turbulence and fire-spotting effects into wild-land fire simulators
- Towards real-time cardiac mechanics modelling with patient-specific heart anatomies
- Analytical solution from vector potentials for the gravitational field of a general polyhedron
- A simple but effective improvement to the plumb-line algorithm
- Isogeometric analysis for compound B-spline surfaces
- Point in polygon problem via homotopy and Hopf's degree theorem
- The Hausdorff core problem on simple polygons
- scientific article; zbMATH DE number 3879610 (Why is no real title available?)
- scientific article; zbMATH DE number 2061057 (Why is no real title available?)
- Enhanced modified-polygon method for point-in-polygon problem
- An application of complex integration for solving a topic on graphic computation
- Heuristic sequencing methods for time optimal tracking of nested, open and closed paths
- Embedded finite volume technique for fluid/rigid-body interaction problems
- Towards off-the-grid algorithms for total variation regularized inverse problems
- Provably correct floating-point implementation of a point-in-polygon algorithm
- Computing Tchakaloff-like cubature rules on spline curvilinear polygons
- Unification of parametric and implicit methods for shape sensitivity analysis and optimization with fixed mesh
- A multi-dimensional unified concavity and convexity detection method based on geometric algebra
- Robust and efficient pre-processing techniques for particle-based methods including dynamic boundary generation
- Computation of a distance field by means of combined geometry representation in fluid dynamics simulations with embedded boundaries
- A high-fidelity framework for point-particle direct numerical simulation based on multi-block overset grids
- Bivariate polynomial histopolation techniques on Padua, Fekete, and Leja triangles
- A data mining algorithm via decentralized optimization in parallel or distributed systems: mathematical aspects
- Efficient capacitated clustering algorithm through convex polygon boundary perturbation
- Automatic generating and spread of a plastic region in PIES
This page was built for publication: The point of polygon problem for arbitrary polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952585)
