Abstract A sweepline algorithm for Euclidean Voronoi diagram of circles

Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed algorithm constructs the correct Voronoi diagram as a sweepline moves on the plane from top to bottom. While moving on the plane, the sweepline stops only at certain event points where the topology changes occur for the Voronoi diagram being constructed. The worst-case time complexity of the proposed algorithm is O((nCm)log n), where n is the number of input circles, and m is the number of intersection points among circles. As m can be O(n 2), the presented algorithm is optimal with O(n 2 log n) worst-case time complexity

A New Singular S-FEM For The Linear Elastic Fracture Mechanics

Ph.DDOCTOR OF PHILOSOPH

Autonomous Robot Navigation through a Crowded and Dynamic Environment: Using A Novel form of Path Planning to Demonstrate Consideration towards Pedestrians and other Robots

This thesis presents a novel path planning algorithm for robotic crowd navigation through a pedestrian environment. The robot is designed to negotiate its way through the crowd using considerate movements. Unlike many other path planning algorithms, which assume cooperation with other pedestrians, this algorithm is completely independent and requires only observation. A considerate navigation strategy has been developed in this thesis, which utilises consideration as an directs an autonomous mobile robot. Using simple methods of predicting pedestrian movements, as well as simple relative distance and trajectory measurements between the robot and pedestrians, the robot can navigate through a crowd without causing disruption to pedestrian trajectories. Dynamic pedestrian positions are predicted using uncertainty ellipses. A novel Voronoi diagram-visibility graph hybrid roadmap is implemented so that the path planner can exploit any available gaps in between pedestrians, and plan considerate paths. The aim of the considerate path planner is to have the robot behave in specific ways when moving through the crowd. By predicting pedestrian trajectories, the robot can avoid interfering with them. Following preferences to move behind pedestrians, when cutting across their trajectories; to move in the same direction of the crowd when possible; and to slow down in crowded areas, will prevent any interference to individual pedestrians, as well as preventing an increase in congestion to the crowd as a whole. The effectiveness of the considerate navigation strategy is evaluated using simulated pedestrians, multiple mobile robots loaded with the path planning algorithm, as well as a real-life pedestrian dataset. The algorithm will highlight its ability to move with the aforementioned consideration towards each individual dynamic agent

Modelação do fluxo de informação no processo de construção : aplicação ao licenciamento automático de projectos

Tese de doutorado. Engenharia Civil. Faculdade de Engenharia. Universidade do Porto. 200