A Polynomial Algorithm for Minimal Interval Representation
نویسندگان
چکیده
A three-dimensional object has many possible representations inside a computer. Specifically, constructive solid geometry, boundary representation, and volumetric approximation techniques are commonly used to represent objects in solid geometric modeling (see [4]). Among the volumetric schemes are the octree [3] and the more recently developed switching-function representation [6] in which the object is modeled as occupying precisely those points for which the switching function value
منابع مشابه
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...
متن کاملMinimal and short representations of unit interval and unit circular-arc graphs
We consider the unrestricted, minimal, and bounded representation problems for unit interval (UIG) and unit circular-arc (UCA) graphs. In the unrestricted version, a proper circular-arc (PCA) modelM is given and the goal is to obtain an equivalent UCA model U . We show a linear time algorithm with negative certification that can also be implemented to run in logspace. In the bounded version,M i...
متن کاملNumerical solution for the risk of transmission of some novel coronavirus (2019-nCov) models by the Newton-Taylor polynomial solutions
In this paper we consider two type of mathematical models for the novel coronavirus (2019-nCov), which are in the form of a nonlinear differential equations system. In the first model the contact rate, , and transition rate of symptomatic infected indeviduals to the quarantined infected class, , are constant. And in the second model these quantities are time dependent. These models are the...
متن کاملMathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks
In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...
متن کاملMinimal comparability completions
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a comparability graph, called a comparability completion of the input graph. Computing a comparability completion with the minimum possible number of added edges is an NP-hard problem. Our purpose here is to add an inclusion minimal set of edges to obtain a minimal comparability completion, which mean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 13 شماره
صفحات -
تاریخ انتشار 1992