نتایج جستجو برای: signed distance method

تعداد نتایج: 1833325  

Journal: :ACM Transactions on Multimedia Computing, Communications, and Applications 2023

The latest advancements in Virtual Reality(VR) enable the creation of 3D models within a holographic immersive simulation environment. In this paper, we create QuickCSGModeling , user-friendly mid-air interactive modeling system. We first prepare dataset consisting diverse components and precompute discrete signed distance function (SDF) for each component. During phase, users can freely design...

Journal: :Advances in Complex Systems 2023

Graph representation learning (GRL) has become a prominent tool for furthering the understanding of complex networks providing tools network embedding, link prediction, and node classification. In this paper, we propose Hybrid Membership-Latent Distance Model (HM-LDM) by exploring how Latent (LDM) can be constrained to latent simplex. By controlling edge lengths corners simplex, volume space sy...

Journal: :Int. J. Computational Intelligence Systems 2014
Faezeh Torkian Mohsen Arefi Mohammad Ghasem Akbari

The purpose of this study is to introduce a new regression model, based on the least squares method, when the available data of both explanatory variable(s) and response variable are interval-valued fuzzy (IVF) numbers. The proposed method is based on a new metric on the space of IVF numbers, which is an extended version of the signed distance introduced by Yao and Wu (2000). In order to evalua...

2015
Chuan-Min Lee Cheng-Chien Lo Rui-Xin Ye Xun Xu Xiao-Han Shi Jia-Ying Li

This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We...

2000
José Gomes Olivier D. Faugeras

This paper is concerned with the simulation of the Partial Diierential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately t...

1999
José Gomes Olivier D. Faugeras

This paper is concerned with the simulation of the Partial Diierential Equation (PDE) driven evolution of a closed surface by means of an implicit representation. In most applications, the natural choice for the implicit representation is the signed distance function to the closed surface. Osher and Sethian propose to evolve the distance function with a Hamilton-Jacobi equation. Unfortunately t...

2004
Masaaki Niimura Yasushi Fuwa

In this article, a new radix-2 signed-digit number (Radix-2 sub signed-digit number) is defined and its properties for hardware realization are discussed. Until now, high speed calculation method with Radix-2 signed-digit numbers is proposed, but this method used “Compares With 2” to calculate carry. “Compares with 2” is a very simple method, but it needs very complicated hardware especially wh...

2009
Paul Bourgine Peter Frolkovic Karol Mikula Nadine Peyriéras Mariana Remesíková

We suggest an efficient method for automatic detection of the intercellular skeleton in microscope images of early embryogenesis. The method is based on the solution of two advective PDEs. First, we solve numerically the time relaxed eikonal equation in order to obtain the signed distance function to a given set – a set of points representing cell centers or a set of closed curves representing ...

2017
Shirui Li Alper Yilmaz Changlin Xiao Hua Li

In this paper, we proposed a new method to detect 4D spatiotemporal interest point called 4D-ISIP(4 dimension implicit surface interest point). We implicitly represent the 3D scene by 3D volume which has a truncated signed distance function (TSDF) in every voxel. The TSDF represents the distance between the spatial point and object surface which is a kind of implicit surface representation. The...

Journal: :Discrete Mathematics 2008
Elena V. Konstantinova

The problem of reconstructing signed permutations on n elements from their erroneous patterns distorted by reversal errors is considered in this paper.A reversal is the operation of taking a segment of the signed permutation, reversing it, and flipping the signs of its elements. The reversal metric is defined as the least number of reversals transforming one signed permutation into another. It ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید