Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Point in polygon
OpenAlex ID:
C59902600
Computational Geometry in C
1998
·
Joseph O'Rourke
·
Cambridge University Press eBooks
·
1,102
Solving geometric problems with the rotating calipers
1983
·
Godfried T. Toussaint
·
640
The point in polygon problem for arbitrary polygons
2001
·
Kai Hormann
, Alexander Agathos
·
Computational Geometry
·
475
PDF
A developer's survey of polygonal simplification algorithms
2001
·
D.P. Luebke
·
IEEE Computer Graphics and Applications
·
471
Operations on Images Using Quad Trees
1979
·
Gregory M. Hunter
, Kenneth Steiglitz
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
461
Hidden surface removal using polygon area sorting
1977
·
Kevin Weiler
, Peter Atherton
·
ACM SIGGRAPH Conference (SIGGRAPH)
·
345
Mean value coordinates for arbitrary planar polygons
2006
·
Kai Hormann
, Michael S. Floater
·
ACM Transactions on Graphics
·
304
Plate tectonic reconstructions with continuously closing plates
2011
·
Michael Gurnis
, Mark Turner
, et al.
·
Computers & Geosciences
·
300
Searching for a Mobile Intruder in a Polygonal Region
1992
·
Ichiro Suzuki
, Masafumi Yamashita
·
SIAM Journal on Computing
·
297
A linear algorithm for computing the visibility polygon from a point
1981
·
H El Gindy
, D Avis
·
Journal of Algorithms
·
266
Visibility of disjoint polygons
1986
·
Takao Asano
, Tetsuo Asano
, et al.
·
Algorithmica
·
255
The nested radiosity model for the distribution of light within plant canopies
1998
·
Michael Chelle
, Bruno Andrieu
·
Ecological Modelling
·
245
A method for the enumeration of various classes of column-convex polygons
1996
·
Mireille Bousquet-Mélou
·
Discrete Mathematics
·
241
PDF
Generalized Polygons
1998
·
Hendrik Van Maldeghem
·
Springer eBooks
·
233
Hidden surface removal using polygon area sorting
1977
·
Kevin Weiler
, Peter Atherton
·
ACM SIGGRAPH Computer Graphics
·
228
PDF
Efficient clipping of arbitrary polygons
1998
·
Günther Greiner
, Kai Hormann
·
ACM Transactions on Graphics
·
211
PDF
Decomposing a Polygon into Simpler Components
1985
·
J. Mark Keil
·
SIAM Journal on Computing
·
205
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
1981
·
Avis
, Toussaint
·
IEEE Transactions on Computers
·
182
Touring a sequence of polygons
2003
·
Moshe Dror
, Alon Efrat
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
175
Monte carlo estimates of the distributions of the random polygons of the voronoi tessellation with respect to a poisson process
1980
·
A.L. Hinde
, R.E. Miles
·
Journal of Statistical Computation and Simulation
·
172
Polygon decomposition for efficient construction of Minkowski sums
2002
·
Pankaj K. Agarwal
, Eyal Flato
, et al.
·
Computational Geometry
·
166
PDF
Compaction and separation algorithms for non-convex polygons and their applications
1995
·
Zhenyu Li
, Victor Milenkovic
·
European Journal of Operational Research
·
161
Inapproximability Results for Guarding Polygons and Terrains
2001
·
S. Eidenbenz
, C. Stamm
, et al.
·
Algorithmica
·
160
Visibility-polygon search and euclidean shortest paths
1985
·
Takao Asano
, Tetsuo Asano
, et al.
·
Annual Symposium on Foundations of Computer Science
·
155
A new linear algorithm for intersecting convex polygons
1982
·
Joseph O'Rourke
, Chi-Bin Chien
, et al.
·
Computer Graphics and Image Processing
·
151
Show more works
View as search
Works count:
1,625
Citation count:
21,190
Year
Topic
Type