Keyword: geometry

Found 61 papers in total
Simple a posteriori error estimators in adaptive isogeometric analysis
Simple a posteriori error estimators in adaptive isogeometric analysis
2015,
In this article we propose two simple a posteriori error estimators for solving second...
Six mathematical gems from the history of distance geometry
Six mathematical gems from the history of distance geometry
2016,
This is a partial account of the fascinating history of distance geometry. We make no...
Polygonal Representations of Digital Sets
Polygonal Representations of Digital Sets
2004,
In the context of discrete curve evolution the following problem is of relevance:...
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
2011,
This work considers the problem of estimating the relative positions of all atoms of a...
Automated computation of the fundamental matrix for vision based construction site applications
Automated computation of the fundamental matrix for vision based construction site applications
2011,
Estimating the fundamental matrix (F), to determine the epipolar geometry between a...
A novel non-linear approach to minimal area rectangular packing
A novel non-linear approach to minimal area rectangular packing
2010,
This paper discusses the minimal area rectangular packing problem which is to pack a...
Optimal rectangle packing
Optimal rectangle packing
2010,
We consider the NP-complete problem of finding an enclosing rectangle of minimum area...
Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems
Generalized hyper-heuristics for solving 2D Regular and Irregular Packing Problems
2010,
The idea behind hyper-heuristics is to discover some combination of straightforward...
An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width
An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width
2009,
Given a set P of n points in the plane, we consider the problem of finding a planar...
A dual algorithm for the minimum covering ball problem in ℝn
A dual algorithm for the minimum covering ball problem in ℝn
2009,
A dual type algorithm constructs the minimum covering ball of a given finite set of...
Efficiently packing unequal disks in a circle
Efficiently packing unequal disks in a circle
2008,
Placing non-overlapping circles in a smallest container is a hard task. In this paper...
A note on optimal floodlight illumination of stages
A note on optimal floodlight illumination of stages
2008,
We consider the problem of illuminating a straight line segment with floodlights. The...
Complete and robust no-fit polygon generation for the irregular stock cutting problem
Complete and robust no-fit polygon generation for the irregular stock cutting problem
2007,
The no-fit polygon is a construct that can be used between pairs of shapes for fast...
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
2008,
The nofit polygon is a powerful and effective tool for handling the geometric...
On packing rectangles with resource augmentation: maximizing the profit
On packing rectangles with resource augmentation: maximizing the profit
2008,
We consider the problem of packing rectangles with profits into a bounded square...
Estimating the circle closest to a set of points by maximum likelihood using the Berndt, Hall, Hall and Hausman (BHHH) algorithm
Estimating the circle closest to a set of points by maximum likelihood using the Berndt, Hall, Hall and Hausman (BHHH) algorithm
2006,
The purpose of this paper is to exploit the idea that, in linear models, the...
Locating an obnoxious plane
Locating an obnoxious plane
2006,
Let S be a set of n points in three-dimensional Euclidean space. We consider the...
Second derivative and sufficient optimality conditions for shape functionals
Second derivative and sufficient optimality conditions for shape functionals
2000,
For some heuristic approaches to boundary variation in shape optimization the...
The irregular nesting problem: a new approach for nofit polygon calculation
The irregular nesting problem: a new approach for nofit polygon calculation
2007,
This paper presents a new approach for generating the nofit polygon (NFP) that is...
Locating a circle on a sphere
Locating a circle on a sphere
2007,
We consider the problem of locating a spherical circle with respect to existing...
Note on: An improved algorithm for the packing of unequal circles within a larger containing circle
Note on: An improved algorithm for the packing of unequal circles within a larger containing circle
2006,
This note proposes an improved version of the algorithm proposed by Wang et al. for...
Packing into the smallest square: Worst-case analysis of lower bounds
Packing into the smallest square: Worst-case analysis of lower bounds
2006,
We address the problem of packing a given set of rectangles into the minimum size...
Algorithms for the frame of a finitely generated unbounded polyhedron
Algorithms for the frame of a finitely generated unbounded polyhedron
2006,
Consider two finite sets 𝒜 and 𝒱 of points in m -dimensional space. The...
Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
2006,
In this paper, we will propose algorithms for calculating a minimal ellipsoid...
Papers per page: