|
Visibility Graph
In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane. Each node in the graph represents a point location, and each edge represents a visible connection between them. That is, if the line segment connecting two locations does not pass through any obstacle, an edge is drawn between them in the graph. When the set of locations lies in a line, this can be understood as an ordered series. Visibility graphs have therefore been extended to the realm of time series analysis. Applications Visibility graphs may be used to find Euclidean shortest paths among a set of polygonal obstacles in the plane: the shortest path between two obstacles follows straight line segments except at the vertices of the obstacles, where it may turn, so the Euclidean shortest path is the shortest path in a visibility graph that has as its nodes the start and destination points and the verti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity. Analysis of algorithms, Computational complexity is central to computational geometry, with great practical significance if algorithms are used on very large datasets containing tens or hundreds of millions of points. For such sets, the difference between O(''n''2) and O(''n'' log ''n'') may be the difference between days and seconds of computation. The main impetus for the development of computational geometry as a discipline was progress in computer graphics and computer-aided design and manufacturing (Computer-aided design, CAD/Compu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Architecture
Architecture is the art and technique of designing and building, as distinguished from the skills associated with construction. It is both the process and the product of sketching, conceiving, planning, designing, and constructing buildings or other structures. The term comes ; ; . Architectural works, in the material form of buildings, are often perceived as cultural symbols and as works of art. Historical civilizations are often identified with their surviving architectural achievements. The practice, which began in the prehistoric era, has been used as a way of expressing culture for civilizations on all seven continents. For this reason, architecture is considered to be a form of art. Texts on architecture have been written since ancient times. The earliest surviving text on architectural theories is the 1st century AD treatise '' De architectura'' by the Roman architect Vitruvius, according to whom a good building embodies , and (durability, utility, and beauty). ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robot Control
Robotic control is the system that contributes to the movement of robots. This involves the mechanical aspects and programmable systems that makes it possible to control robots. Robotics could be controlled in various ways, which includes using manual control, wireless control, semi-autonomous (which is a mix of fully automatic and wireless control), and fully autonomous (which is when it uses artificial intelligence to move on its own, but there could be options to make it manually controlled). In the present day, as technological advancements progress, robots and their methods of control continue to develop and advance. Modern robots (2000-present) Medical and surgical In the medical field, robots are used to make precise movements that are humanly difficult. Robotic surgery involves the use of less-invasive surgical methods, which are “procedures performed through tiny incisions”. Currently, robots use the da Vinci surgical method, which involves the robotic arm (whic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Springer-Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business internationally, o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Space Syntax
The term space syntax encompasses a set of theories and techniques for the analysis of spatial configurations. It was conceived by Bill Hillier, Julienne Hanson, and colleagues at The Bartlett, University College London in the late 1970s to early 1980s to develop insights into the mutually constructive relation between society and space. As space syntax has evolved, certain measures have been found to correlate with human spatial behavior, and space syntax has thus come to be used to forecast likely effects of architectural and urban space on users. Thesis The general idea is that spaces can be broken down into components, analyzed as networks of choices, then represented as maps and graphs that describe the relative connectivity and integration of those spaces. It rests on three basic conceptions of space: * an isovist (popularised by Michael Benedikt at University of Texas), or viewshed or visibility polygon, the field of view from any particular point * axial space (idea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fuzzy Architectural Spatial Analysis
Fuzzy architectural spatial analysis (FASA) (also fuzzy inference system (FIS) based architectural space analysis or fuzzy spatial analysis) is a spatial analysis method of analysing the spatial formation and architectural space intensity within any architectural organization. Fuzzy architectural spatial analysis is used in architecture, interior design, urban planning and similar spatial design fields. Overview Fuzzy architectural spatial analysis was developed by Burcin Cem Arabacioglu (2010) from the architectural theories of space syntax and visibility graph analysis,Turner, Alasdair; Doxa, Maria; O'Sullivan, David and Penn, Alan (2001). "From isovists to visibility graphs: a methodology for the analysis of architectural space". Environment and Planning B 28 (1): 103–121. and is applied with the help of a fuzzy system with a Mamdami inference system based on fuzzy logic within any architectural space. Fuzzy architectural spatial analysis model analyses the space by consi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Visibility Graph Analysis
In architecture, visibility graph analysis (VGA) is a method of analysing the inter-visibility connections within buildings or urban networks. Visibility graph analysis was developed from the architectural theory of space syntax by Turner et al. (2001), and is applied through the construction of a visibility graph within the open space of a plan. Visibility graph analysis uses various measures from the theory of small-world networks and centrality in network theory in order to assess perceptual qualities of space and the possible usage of it. Visibility graph analysis was firstly implemented in Turner's Depthmap software and is now widely used by both academics and practitioners through the open source and multi-platformbr>depthmapXdeveloped by Tasos Varoudis. Another opensource and multi-platform software that implements visibility graphs is topologicpdeveloped by Wassim Jabi. See also *Fuzzy architectural spatial analysis *Isovist *Spatial network analysis software *Viewshed ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bitangent
In geometry, a bitangent to a curve is a line that touches in two distinct points and and that has the same direction as at these points. That is, is a tangent line at and at . Bitangents of algebraic curves In general, an algebraic curve will have infinitely many secant lines, but only finitely many bitangents. Bézout's theorem implies that an algebraic plane curve with a bitangent must have degree at least 4. The case of the 28 bitangents of a quartic was a celebrated piece of geometry of the nineteenth century, a relationship being shown to the 27 lines on the cubic surface. Bitangents of polygons The four bitangents of two disjoint convex polygons may be found efficiently by an algorithm based on binary search in which one maintains a binary search pointer into the lists of edges of each polygon and moves one of the pointers left or right at each steps depending on where the tangent lines to the edges at the two pointers cross each other. This bitangent calculation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dominating Set
In graph theory, a dominating set for a graph is a subset of its vertices, such that any vertex of is either in , or has a neighbor in . The domination number is the number of vertices in a smallest dominating set for . The dominating set problem concerns testing whether for a given graph and input ; it is a classical NP-complete decision problem in computational complexity theory. Therefore it is believed that there may be no efficient algorithm that can compute for all graphs . However, there are efficient approximation algorithms, as well as efficient exact algorithms for certain graph classes. Dominating sets are of practical interest in several areas. In wireless networking, dominating sets are used to find efficient routes within ad-hoc mobile networks. They have also been used in document summarization, and in designing secure systems for electrical grids. Formal definition Given an undirected graph , a subset of vertices D\subseteq V is called a dominating se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Art Gallery Problem
The art gallery problem or museum problem is a well-studied visibility problem in computational geometry. It originates from the following real-world problem: In the geometric version of the problem, the layout of the art gallery is represented by a simple polygon and each guard is represented by a point in the polygon. A set S of points is said to guard a polygon if, for every point p in the polygon, there is some q\in S such that the line segment between p and q does not leave the polygon. The art gallery problem can be applied in several domains such as in robotics, when artificial intelligences (AI) need to execute movements depending on their surroundings. Other domains, where this problem is applied, are in image editing, lighting problems of a stage or installation of infrastructures for the warning of natural disasters. Two dimensions There are numerous variations of the original problem that are also referred to as the art gallery problem. In some versions guards ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hamiltonian Graph
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle that visits each vertex exactly once. A Hamiltonian path that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian cycle, and removing any edge from a Hamiltonian cycle produces a Hamiltonian path. Determining whether such paths and cycles exist in graphs (the Hamiltonian path problem and Hamiltonian cycle problem) are NP-complete. Hamiltonian paths and cycles are named after William Rowan Hamilton who invented the icosian game, now also known as ''Hamilton's puzzle'', which involves finding a Hamiltonian cycle in the edge graph of the dodecahedron. Hamilton solved this problem using the icosian calculus, an algebraic structure based on roots of unity with many similarities to the quaternions (also invented by Hami ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simple Polygon
In geometry, a simple polygon is a polygon that does not Intersection (Euclidean geometry), intersect itself and has no holes. That is, it is a flat shape consisting of straight, non-intersecting line segments or "sides" that are joined pairwise to form a single closed curve, closed path. If the sides intersect then the polygon is not simple. The qualifier "simple" is frequently omitted, with the above definition then being understood to define a polygon in general. The definition given above ensures the following properties: * A polygon encloses a region (mathematics), region (called its interior) which always has a measurable area. * The line segments that make up a polygon (called sides or edges) meet only at their endpoints, called vertices (singular: vertex) or less formally "corners". * Exactly two edges meet at each vertex. * The number of edges always equals the number of vertices. Two edges meeting at a corner are usually required to form an angle that is not straight ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
