Results 41 to 50 of about 4,303,118 (363)
Convolutional Neural Network-Based Approximation of Coverage Path Planning Results for Parking Lots
Parking lots have wide variety of shapes because of surrounding environment and the objects inside the parking lot, such as trees, manholes, etc. In the case of paving the parking lot, as much area as possible should be covered by the construction ...
Andrius Kriščiūnas +5 more
doaj +1 more source
Detecting Weakly Simple Polygons [PDF]
25 pages and 13 figures, submitted to SODA ...
Chao Xu, Hsien-Chih Chang, Jeff Erickson
openaire +4 more sources
A simple algorithm for calculating the area of an arbitrary polygon
Computing the area of an arbitrary polygon is a popular problem in pure mathematics. The two methods used are Shoelace Method (SM) and Orthogonal Trapezoids Method (OTM).
K.R. Wijeweera, S.R. Kodituwakku
doaj +1 more source
Pre-determination of prediction of yield-line pattern of slabs using Voronoi diagrams
The article presents a new method of predicting the yield-lines of statically loaded slabs, based on roof geometry (straight skeletons) and Voronoi diagrams for a polygon.
Koźniewski Edwin, Orłowski Marcin
doaj +1 more source
On Reconfiguring Tree Linkages: Trees can Lock [PDF]
It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex.
Biedl, Therese +9 more
core +10 more sources
Fabrication of ZnO/CuO Hybrid Nanocomposite for Photocatalytic Degradation of Brilliant Cresyl Blue (BCB) Dye in Aqueous Solutions [PDF]
Here in the present study, we report the synthesis of ZnO nanoparticles, ZnO/CuO(3%), ZnO/CuO(5%), and ZnO/CuO(10%), nanocomposites using simple precipitation method with variation of CuO content and the activities of prepared samples were investigated ...
PARMESHWAR MEENA +2 more
doaj +1 more source
Drawing Planar Graphs with a Prescribed Inner Face [PDF]
Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of ...
C.A. Duncan +7 more
core +2 more sources
Kinetic collision detection for simple polygons [PDF]
We design a simple and elegant kinetic data structure for detecting collisions between polygonal (but not necessarily convex) objects in motion in the plane. Our structure is compact, maintaining an active set of certificates whose number is proportional to a minimum-size set of separating polygons for the objects.
David Kirkpatrick +2 more
openalex +6 more sources
A Spatially Bounded Airspace Axiom
Free Route Airspace (FRA), a new concept implemented across European airspace, is designed to eliminate the adverse effects of air traffic, reduce fuel consumption, simplify and expand flight planning.
Peter Szabó +2 more
doaj +1 more source
New results on stabbing segments with a polygon [PDF]
We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element
Díaz Bañez, José Miguel +5 more
core +2 more sources

