Keyword: geometry

Found 61 papers in total
Continuous location of dimensional structures
Continuous location of dimensional structures
2004,
A natural extension of point facility location problems are those problems in which...
Parametric on-line algorithms for packing rectangles and boxes
Parametric on-line algorithms for packing rectangles and boxes
2003,
We present approximation algorithms for the following problems: the two-dimensional...
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
2003,
The two-dimensional vector packing problem is the generalization of the classical...
A non-recursive algorithm for polygon triangulation
A non-recursive algorithm for polygon triangulation
2003,
In this paper an algorithm for the convex polygon triangulation based on the reverse...
A tutorial for designing flexible geometric algorithms
A tutorial for designing flexible geometric algorithms
2002,
The implementation of an algorithm is faced with the issues of efficiency,...
Geometrical reasoning based on attributed graph grammar for prismatic parts
Geometrical reasoning based on attributed graph grammar for prismatic parts
1999,
Modern manufacturing systems rely on a smooth and quick transformation of the design...
Evaluation of cylindricity using combinatorics
Evaluation of cylindricity using combinatorics
1999,
Several numerical methods have been developed for finding the minimum zone of a...
Finding minimum area simple pentagons
Finding minimum area simple pentagons
1997,
Given a set P of n points in the plane, we want to find a simple, not necessarily...
Fitting rectilinear polygonal curves to a set of points in the plane
Fitting rectilinear polygonal curves to a set of points in the plane
2001,
In this paper two problems of fitting rectilinear polygonal curves to a set of points...
The irregular cutting-stock problem – a new procedure for deriving the no-fit polygon
The irregular cutting-stock problem – a new procedure for deriving the no-fit polygon
2001,
The nofit polygon is a powerful and effective tool for handling the geometry required...
Covering a rectangle with six and seven circles
Covering a rectangle with six and seven circles
2000,
In a recent article Heppes and Melissen have determined the thinnest coverings of a...
Translational polygon containment and minimal enclosure using mathematical programming
Translational polygon containment and minimal enclosure using mathematical programming
1999,
A new algorithm is given for the two-dimensional translational containment problem:...
A method of optimal lattice packing of congruent oriented polygons in the plane
A method of optimal lattice packing of congruent oriented polygons in the plane
2000,
An approach based on an application of the δ-function apparatus is proposed for...
An interval method to validate optimal solutions of the ‘packing circles in a unit square’ problems
An interval method to validate optimal solutions of the ‘packing circles in a unit square’ problems
2000,
A numerical algorithm using new kinds of approaches is presented for the packing...
Some new structures for the ‘equal circles packing in a square’ problem
Some new structures for the ‘equal circles packing in a square’ problem
2000,
To find the densest packing for n equal and non-overlapping circles in a square is a...
Location problems: From classical geometry to managerial decisions
Location problems: From classical geometry to managerial decisions
2000,
We sketch the development of location problems from the beginnings in the 17th century...
Generalized golden sections, repeated bisections and aesthetic pleasure
Generalized golden sections, repeated bisections and aesthetic pleasure
2000,
We generalize the golden section in the sense that we partition a given line segment...
On a ‘Complementary problem’ of Courant and Robbins
On a ‘Complementary problem’ of Courant and Robbins
1998,
For a given triangle ABC with ∠ A > 120°, the Simpson variant of...
A geometrical construction of the set of strictly efficient points in the polyhedral norm case
A geometrical construction of the set of strictly efficient points in the polyhedral norm case
1997,
We propose a new approach to construct in the plane the set of strictly efficient...
Locating line segments with vertical distances
Locating line segments with vertical distances
1997,
One generalization of the Weber problem is to locate not a single point, but...
Perturbation of sets and medians
Perturbation of sets and medians
1996,
In this paper we consider medians of finite sets. We indicate some simple properties...
Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
1998,
A mathematical model of the problem is constructed. A feasible region and...
Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
1996,
This work deals with the problem of optimal allocation of objects of a so-called...
Containment of a single polygon using mathematical programming
Containment of a single polygon using mathematical programming
1996,
This paper investigates the polygon containment problem, to determine whether a given...
Papers per page: