19 search results - page 4 / 4 » Disjoint Color-Avoiding Triangles |
CCCG
1994
13 years 6 months ago
1994
We consider bounding the cardinality of an arbitrary triangulation with smallest angle : We show that if the local feature size (i.e. distance between disjoint vertices or edges) ...
COMGEO
2004
ACM
13 years 5 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
TKDE
2008
13 years 5 months ago
2008
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
COMPGEOM
2007
ACM
13 years 7 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...