Keyword: geometry

Found 61 papers in total
On genetic algorithms for the packing of polygons
On genetic algorithms for the packing of polygons
1996,
A genetic algorithm for placing polygons on a rectangular board is proposed. The...
A new algorithm for the minimal-area convex enclosure problem
A new algorithm for the minimal-area convex enclosure problem
1995,
The problem of cutting parts from a piece of material occurs in a number of settings....
Compaction and separation algorithms for non-convex polygons and their applications
Compaction and separation algorithms for non-convex polygons and their applications
1995,
Given a two-dimensional, non-overlapping layout of convex and non-convex polygons,...
On the minimum distance determined by n(≤7) points in an isosceles right triangle
On the minimum distance determined by n(≤7) points in an isosceles right triangle
1996,
Let T denote a finite set of points in a unit isosceles right triangle (i.e., the...
Fast algorithms for complete linkage clustering
Fast algorithms for complete linkage clustering
1998,
It is shown that the complete linkage clustering of n points can be computed in >O(...
Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
1997,
We give fast and efficient methods for constructing ϵ-nets and...
Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
1997,
In this paper, we give an algorithm for output-sensitive construction of an f -face...
On Torricelli’s geometrical solution to a problem of Fermat
On Torricelli’s geometrical solution to a problem of Fermat
1997,
Around 1640, Torricelli devised a geometrical solution to a problem, allegedly first...
An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
1997,
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes...
A new algorithm for the two-polygon containment problem
A new algorithm for the two-polygon containment problem
1997,
This article addresses the two-polygon containment problem. The problem is to...
Probing the arrangement of hyperplanes
Probing the arrangement of hyperplanes
1995,
This paper investigates the combinatorial complexity of an algorithm to determine the...
Objects arranged randomly in space: An accessible theory
Objects arranged randomly in space: An accessible theory
1989,
This expository paper deals with many problems concerning bounded objects arranged...
Random spherical triangles I: Geometrical background
Random spherical triangles I: Geometrical background
1989,
This paper identifies the shape space Σ( S 2 ,k) for k labelled points on the...
Papers per page: