2601 search results - page 5 / 521 » A Point in Many Triangles |
DCG
2006
13 years 7 months ago
2006
CCCG
2010
13 years 9 months ago
2010
Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.
ESA
2000
Springer
13 years 11 months ago
2000
Springer
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.
MOC
2000
13 years 7 months ago
2000
These tables record results on curves with many points over finite fields. For relatively small genus (0 g 50) and q a small power of 2 or 3 we give in two tables the best presen...