ENUMERATION ALGORITHM OF 3D FLOORPLAN BASED ON REVERSE SEARCH METHOD

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reverse Search for Enumeration

The reverse search technique has been recently introduced by the authors for eflicicnt enumeration of vertices of polyhedra and arrangements. In this paper, we develop this idea in a general framework and show its broader applications to various problems in operations research, combinatorics, and geometry. In particular. we propose new algorithms for listing (i) all triangulations of a set of n...

متن کامل

Computational Experience with the Reverse Search Vertex Enumeration Algorithm

This paper describes computational experience obtained in the development of the lrs code, which uses the reverse search technique to solve the vertex enumeration/convex hull problem for d-dimensional convex polyhedra. We giv e empirical results showing improvements obtained by the use of lexicographic perturbation, lifting, and integer pivoting. We also give some indication of the cost of usin...

متن کامل

lrs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm

This paper describes an improved implementation of the reverse search vertex enumeration/convex hull algorithm for d-dimensional convex polyhedra. The implementation uses a lexicographic ratio test to resolve degeneracy, works on bounded or unbounded polyhedra and uses exact arithmetic with all integer pivoting. It can also be used to compute the volume of the convex hull of a set of points. Fo...

متن کامل

AN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM

This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...

متن کامل

A generalized enumeration of labeled trees and reverse Prüfer algorithm

A leader of a tree T on [n] is a vertex which has no smaller descendants in T . Gessel and Seo showed that ∑ T ∈Tn u(# of leaders in T )c(degree of 1 in T ) = uPn−1(1, u, cu), which is a generalization of Cayley’s formula, where Tn is the set of trees on [n] and Pn(a, b, c)= c n−1 ∏ i=1 ( ia + (n− i)b+ c. Using a variation of the Prüfer code which is called a RP-code, we give a simple bijective...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Architecture and Planning (Transactions of AIJ)

سال: 2017

ISSN: 1340-4210,1881-8161

DOI: 10.3130/aija.82.1389