Interactive surface correction based on a local approximation scheme
نویسندگان
چکیده
منابع مشابه
Local Approximation of Pareto Surface
designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimized simultaneously. Mathematically this problem can be reduced to a vector optimization problem. The solution of this problem is not unique and is represented by a Pareto surface in the space of the objective functions. Once a Pareto solution is obtained, it may be ve...
متن کاملA Local Computation Approximation Scheme to Maximum Matching
We present a polylogarithmic local computation matching algorithm which guarantees a (1−ǫ)-approximation to the maximum matching in graphs of bounded degree.
متن کاملA local measurement-based protection scheme for DER integrated DC microgrid using Bagging Tree
In recent years, DC microgrid has attracted considerable attention of the research community because of the wide usage of DC power-based appliances. However, the acceptance of DC microgrid by power utilities is still limited due to the issues associated with the development of a reliable protection scheme. The high magnitude of DC fault current, its rapid rate of rising and absence of zero cros...
متن کاملInteractive Art Analysis Based on Baudrillard’s Hyper reality Theory, a Case Study of Digital Interactive installation
The contemporary philosopher Jean Baudrillard, one of the postmodernism theorists, considers representation in the contemporary world as a factor in the disappearance of reality. In his view, the main feature of new arts is not the expression of artistic beauty, but communication with the audience and expression of the artist’s ideas. In interactive art, the presence and role of the audience in...
متن کاملOn Approximation Scheme Preserving
In this paper we generalize the notion of polynomial-time approximation scheme preserving reducibility, called PTAS-reducibility, introduced in a previous paper. As a rst application of this generalization, we prove the APX-completeness of a polynomially bounded optimization problem, that is, an APX problem whose measure function is bounded by a polynomial in the length of the instance and such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Aided Geometric Design
سال: 1996
ISSN: 0167-8396
DOI: 10.1016/0167-8396(95)00049-6