نتایج جستجو برای: sun path diagram

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

Journal: :Comput. Geom. 1998
Prosenjit Bose Luc Devroye

We present a systematic study of the expected complexity of the intersection of geometric objects. We first study the expected size of the intersection between a random Voronoi diagram and a generic geometric object that consists of a finite collection of line segments in the plane. Using this result, we explore the intersection complexity of a random Voronoi diagram with the following target o...

2013
JUN WANG MING LI DONG LI

Skeleton extraction algorithm can transform two-dimensional map into a skeleton diagram, which provide more convenience to global path planning of the complex map. This article first extracts skeleton extraction of the global map using the skeleton extraction algorithm and finds all paths of flat map. Based on this we can use search algorithms to search, and find a feasible path connecting star...

2008
MARTIN HELD CHRISTIAN SPIELBERGER

We present an algorithm for generating G 1-continuous spiral-like tool paths for machining pockets without islands. The pocket may be an arbitrary simply-connected 2D shape bounded by straight-line segments and circular arcs. Based on the Voronoi diagram of the pocket we generate a sequence of nested Jordan curves (“wave fronts”) inside the pocket that are linked to form a spiral-like tool path...

2007
Marta Fort J. Antoni Sellarès

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...

Journal: :International Journal of Geographical Information Science 2012
Pilar Moreno-Regidor Jésus García López de Lacalle Miguel-Ángel Manso-Callejo

Territory or zone design processes entail partitioning a geographic space, organized as a set of areal units, into different regions or zones according to a specific set of criteria that are dependent on the application context. In most cases, the aim is to create zones of approximately equal sizes (zones with equal numbers of inhabitants, same average sales, etc.). However, some of the new app...

2011
Johann Schuster Markus Siegle

CASPA is a stochastic process algebra tool for performance and dependability modelling, analysis and verification. It is based entirely on the symbolic data structure MTBDD (Multi-Terminal Binary Decision Diagram) which enables the tool to handle models with very large state space. This paper describes an extension of CASPA’s solving engine for path-based approximation of MTTFF (Mean Time To Fi...

2002
Alon Efrat Leonidas J. Guibas Sariel Har-Peled Joseph S. B. Mitchell

We introduce two new related metrics, the geodesic width and the link width, for measuring the “distance” between two nonintersecting polylines in the plane. If the two polylines have n vertices in total, we present algorithms to compute the geodesic width of the two polylines in O(n2 log n) time using O(n2) space and the link width in O(n3 log n) time using O(n2) working space where n is the t...

2008
E. Khomenko

We use 2D numerical simulations and eikonal approximation, to study properties of MHD waves traveling below the solar surface through the magnetic structure of sunspots. We consider a series of magnetostatic models of sunspots of different magnetic field strengths, from 10 Mm below the photosphere to the low chromosphere. The purpose of these studies is to quantify the effect of the magnetic fi...

2008
S. C. Tripathy

Using the local helioseismic technique of ring diagram we analyze the frequencies of high–degree fand p-modes derived from both velocity and continuum intensity data observed by MDI. Fitting the spectra with asymmetric peak profiles, we find that the asymmetry associated with velocity line profiles is negative for all frequency ranges agreeing with previous observations while the asymmetry of t...

2000
Mark Foskey Maxim Garber Ming C. Lin Dinesh Manocha

We present a new approach for motion planning and maintainability studies in complex 3D CAD environments. It automatically computes a collision-free path for moving objects among stationary and completely known obstacles. Our framework uses a combination of analytic, criticalitybased and probabilistic techniques to compute the path. It starts with an global strategy, which uses an approximate V...

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

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