Sciweavers

5019 search results - page 16 / 1004
» On the Reflexivity of Point Sets
Sort
View
COMPGEOM
2006
ACM
14 years 2 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
JC
2000
78views more  JC 2000»
13 years 8 months ago
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
Fabrice Rouillier, Marie-Françoise Roy, Moh...
CCCG
2007
13 years 10 months ago
Optimal Point Set Partitioning using Rigid Motion Star Placement
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
Prosenjit Bose, Jason Morrison
CCCG
2006
13 years 9 months ago
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
Asish Mukhopadhyay, Robert L. Scot Drysdale
JSCIC
2008
129views more  JSCIC 2008»
13 years 8 months ago
Level Set Equations on Surfaces via the Closest Point Method
Abstract Level set methods have been used in a great number of applications in R2 and R3 and it is natural to consider extending some of these methods to problems defined on surfac...
Colin B. Macdonald, Steven J. Ruuth