9659 search results - page 328 / 1932 » Points on Computable Curves |
164
click to vote
IJCGA
2007
15 years 6 months ago
2007
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
184
click to vote
SIAMJO
2000
15 years 6 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
160
click to vote
ORDER
2002
15 years 6 months ago
2002
In this article we describe a very efficient method to construct pairwise nonisomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer progr...
191
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
212
Voted
EC
2008
15 years 6 months ago
2008
This work describes how evolutionary computation can be used to synthesize lowlevel image operators that detect interesting points on digital images. Interest point detection is a...