Results 1  10
of
783,484
Computing Directional Constrained Delaunay Triangulations
"... In this work, two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph set forth in [7] and [8] are presented. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associa ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this work, two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph set forth in [7] and [8] are presented. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses
Computing Directional Constrained Delaunay Triangulations
, 1998
"... This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in [Vig97] and [Vig95]. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated t ..."
Abstract
 Add to MetaCart
This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in [Vig97] and [Vig95]. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated
Constrained Delaunay triangulations
 Algorithmica
, 1989
"... Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the De ..."
Abstract

Cited by 217 (5 self)
 Add to MetaCart
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed
SNOPT: An SQP Algorithm For LargeScale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 582 (23 self)
 Add to MetaCart
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first
Constrained model predictive control: Stability and optimality
 AUTOMATICA
, 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract

Cited by 696 (15 self)
 Add to MetaCart
important because efficiency demands operating points on or close to the boundary of the set of admissible states and controls. In this review, we focus on model predictive control of constrained systems, both linear and nonlinear and discuss only briefly model predictive control of unconstrained nonlinear
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Goaldirected Requirements Acquisition
 SCIENCE OF COMPUTER PROGRAMMING
, 1993
"... Requirements analysis includes a preliminary acquisition step where a global model for the specification of the system and its environment is elaborated. This model, called requirements model, involves concepts that are currently not supported by existing formal specification languages, such as goal ..."
Abstract

Cited by 572 (17 self)
 Add to MetaCart
where each node captures an abstraction such as, e.g., goal, action, agent, entity, or event, and where the edges capture semantic links between such abstractions. Wellformedness properties on nodes and links constrain their instances  that is, elements of requirements models. Requirements acquisition
Results 1  10
of
783,484