I MAGIS is a joint project of CNRS - INPG - INRIA - UJF iMAGIS-GRAVIR / IMAG A simple kinetic visibility polygon EWCG’02 Samuel Hornus, Claude Puech.

Slides:

Advertisements

Similar presentations

Two Segments Intersect?

Advertisements

Spatial Embedding of Pseudo-Triangulations Peter Braß Institut für Informatik Freie Universität Berlin Berlin, Germany Franz Aurenhammer Hannes Krasser.

Motion Planning for Point Robots CS 659 Kris Hauser.

2/3/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Triangulations and Guarding Art Galleries II Carola Wenk.

* iMAGIS is a joint project of CNRS, INRIA, INPG and UJF. Phenomenological Simulation of Brooks Fabrice Neyret Nathalie Praizelin iMAGIS / GRAVIR - IMAG.

1 Voronoi Diagrams. 2 Voronoi Diagram Input: A set of points locations (sites) in the plane.Input: A set of points locations (sites) in the plane. Output:

The Divide-and-Conquer Strategy

Classes of Polygons Planar polygons Non-planar polygons Simple

Lesson 1.6 Classify Polygons. Objective Classify Polygons.

A Fast Algorithm for Incremental Distance Calculation Paper by Ming C. Ling and John F. Canny Presented by Denise Jones.

CSCE 620: Open Problem Voronoi Diagram of Moving Points Asish Ghoshal Problem 2 from The Open Problems Project 1.

Kinetic Algorithms Data Structure for Mobile Data.

Intersections. Intersection Problem 3 Intersection Detection: Given two geometric objects, do they intersect? Intersection detection (test) is frequently.

Visibility Computations: Finding the Shortest Route for Motion Planning COMP Presentation Eric D. Baker Tuesday 1 December 1998.

Robert Pless, CS 546: Computational Geometry Lecture #3 Last Time: Convex Hulls Today: Plane Sweep Algorithms, Segment Intersection, + (Element Uniqueness,

17. Computational Geometry Chapter 7 Voronoi Diagrams.

Buron Florian CS223b Target finding Visibility-Based Pursuit-Evasion in a Polygonal Environment. L.J. Guibas, J.C. Latombe, S.M. LaValle, D. Lin, and R.

Vocabulary 2.2 – Curves and two dimensional figures (part 1) MA418 Spring 2010 McAllister.

Oct 26, Fall 2006IAT 4101 Collision Detection. Oct 26, Fall 2006IAT 4102 Collision Detection  Essential for many games –Shooting –Kicking, punching,

Content Subdivision First some basics (control point polygon, mesh)

Kinetic Data Structures and their Application in Collision Detection Sean Curtis COMP 768 Oct. 16, 2007.

CS 326A: Motion Planning Basic Motion Planning for a Point Robot.

On Reconfiguring Radial Trees Yoshiyuki Kusakari Akita Prefectural University JCDCG (Sun.)

Oct 3, Fall 2005Game Design1 Collision Detection.

Geometric Probing with Light Beacons on Multiple Mobile Robots Sarah Bergbreiter CS287 Project Presentation May 1, 2002.

The Art Gallery Problem

Introduction to 3D Graphics John E. Laird. Basic Issues u Given a internal model of a 3D world, with textures and light sources how do you project it.

The Art Gallery Problem

Visibility Graphs and Cell Decomposition By David Johnson.

9/7/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries Carola Wenk.

Visibility Graphs and Motion Planning Kittiphan Techakittiroj for the Degree of Master of Science Department of Computer Science, Ball State University,

Math Vocabulary Unit 1: Geometry What am I? ©Mrs. DeAmicis

Chapter 1 Review Review material for Chapter 1 Test.

GRAVIR / IMAG, Grenoble, FRANCE A joint lab of CNRS, INPG, INRIA and UJF June 12, 2003IS4TM, Juan-Les-Pins, FRANCE Real-time Simulation of Self-Collisions.

Path Planning for a Point Robot

I MAGIS is a joint project of CNRS - INPG - INRIA - UJF iMAGIS-GRAVIR / IMAG Controlling Anisotropy in Mass-Spring Systems David Bourguignon and Marie-Paule.

Soham Uday Mehta. Linear Programming in 3 variables.

12.1 Exploring Solids.

CS 312: Algorithm Analysis Lecture #8: Non-Homogeneous Recurrence Relations This work is licensed under a Creative Commons Attribution-Share Alike 3.0.

Polygon Definition Bounded by a closed circuit of straight-line segment. Term Edge : straight line segment Vertices : points.

I MAGIS is a joint project of CNRS - INPG - INRIA - UJF iMAGIS-GRAVIR / IMAG Efficient Parallel Refinement for Hierarchical Radiosity on a DSM computer.

Two Finger Caging of Concave Polygon Peam Pipattanasomporn Advisor: Attawith Sudsang.

MotivationKinetic Data StructuresExampleKDS Properties Networks play a central role in numerous applications, and the design of good networks is therefore.

CS6234 Advanced Algorithms - Convex hull. Terminologies – ◦ Convex hull of a set Q of points is the smallest convex polygon P for which each point in.

CLASSIFYING POLYGONS UNIT 1 LESSON 6. Classifying Polygons In geometry, a figure that lies in a plane is called a plane figure. A polygon is a closed.

Motion Planning Howie CHoset. Assign HW Algorithms –Start-Goal Methods –Map-Based Approaches –Cellular Decompositions.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2010 O’Rourke Chapter 6 with some material.

9/8/10CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2010 Triangulations and Guarding Art Galleries Carola Wenk.

Visible-Surface Detection Methods. To identify those parts of a scene that are visible from a chosen viewing position. Surfaces which are obscured by.

Ch 1.6 CLASSIFY POLYGONS. In this section we will… Look at what makes something a polygon. Identify polygons by their sides and angles Identify polygons.

Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.

Kinetic Data Structures: for computational geometry and for graph drawing Sue Whitesides Computer Science Department.

Translations Geometry – Unit 2. Translations using Digital Technology 

Determine the name of the polygon

2.1 Introduction to Configuration Space

CMPS 3130/6130 Computational Geometry Spring 2017

How do I get there? Roadmap Methods Visibility Graph Voronoid Diagram.

Name the polygon by the number of sides.

Introduction to Polygons

Figure Legend: From: Visual detection of symmetry of 3D shapes

The Art Gallery Problem

Craig Schroeder October 26, 2004

The Art Gallery Problem

6-2 Properties of Parallelograms

Conservative Visibility Preprocessing using Extended Projections Frédo Durand, George Drettakis, Joëlle Thollot and Claude Puech iMAGIS-GRAVIR/IMAG-INRIA.

Computing Shortest Path amid Pseudodisks

Computing the Visibility Polygon of an Island in a Polygonal Domain

Kinetic Collision Detection for Convex Fat Objects

The Visibility– Voronoi Complex and Its Applications

Where We Stand At this point we know how to: Next thing:

Presentation transcript:

i MAGIS is a joint project of CNRS - INPG - INRIA - UJF iMAGIS-GRAVIR / IMAG A simple kinetic visibility polygon EWCG’02 Samuel Hornus, Claude Puech

iMAGIS-GRAVIR / IMAG Hypothesis : simply-polygonal obstacles known algebraic motion (everything can move) Goals : maintaining the visibility polygon continuously Solution : Kinetic Data Structure framework

iMAGIS-GRAVIR / IMAG Overview Kinetic Data Structures (KDS) Visibility polygon Detecting crossing events Updating the visibility polygon Conclusion contributions

iMAGIS-GRAVIR / IMAG Overview Kinetic Data Structures (KDS) Visibility polygon Detecting crossing events Updating the visibility polygon Conclusion

iMAGIS-GRAVIR / IMAG Kinetic Data Structures Moving Items (points, segments, …) Attributes on the items (convex hull, voronoï diagram) given with a proof of correctness for the static case Idea : animating the proof through time when items are moving certificate failure [Bash and Guibas 95]

iMAGIS-GRAVIR / IMAG Kinetic Data Structures Proof of correctness Certificate failure Proof updateAttribute update [Bash and Guibas 95]

iMAGIS-GRAVIR / IMAG Overview Kinetic Data Structures (KDS) Visibility polygon Detecting crossing events Updating the visibility polygon Conclusion

iMAGIS-GRAVIR / IMAG Visibility polygon n vertices / edges Cyclically ordered set of the n tangent rays The visible edge is stored between each pair of tangent rays

iMAGIS-GRAVIR / IMAG Overview Kinetic Data Structures (KDS) Visibility polygon Detecting crossing events Updating the visibility polygon Conclusion

iMAGIS-GRAVIR / IMAG Detecting Events consecutive rays in the ordered set

iMAGIS-GRAVIR / IMAG Detecting Events crossing event !

iMAGIS-GRAVIR / IMAG Detecting Events next crossing event

iMAGIS-GRAVIR / IMAG Detecting Events

iMAGIS-GRAVIR / IMAG Overview Kinetic Data Structures (KDS) Visibility polygon Detecting crossing events Updating the visibility polygon Conclusion

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon Knowing only the visibility polygon is not enough to maintain it, we need more data… We will use a weak radial decomposition of the scene.

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon Each tangent ray consists of - the vertex of « tangency »

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon Each tangent ray consists of - the vertex of « tangency » - the hit edge along the ray, beyond the vertex of tangency

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon Each tangent ray consists of -the vertex of « tangency » - the hit edge along the ray -the visible edge at its left

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon Each tangent ray consists of -the vertex of « tangency » - the hit edge along the ray -the visible edge at its left -the type of the tangency vertex see next slide…

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon Tangent ray type

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon R L hit2 hit1 Before the crossing

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon There is no other tangent ray between these ones Before the crossing R L hit2 hit1

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon C R L hit2 hit1 There is no other tangent ray between these ones Before the crossing C exists if and only if hit1 is different from hit2

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon R L hit2 hit1 Before the crossing, when C does not exist visible = hit2 = hit1

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon After the crossing, R L hit1 := R hit2 R L hit1 Before the crossing, when C does not exist visible = hit2 = hit1 visible := L

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon R L hit2 Before the crossing, when C does not exist visible = C C hit1 = C

iMAGIS-GRAVIR / IMAG Updating the Visibility Polygon After the crossing, L C R hit1 hit2 R L Before the crossing, when C exists visible = C C visible := L hit1 = C

iMAGIS-GRAVIR / IMAG Conclusion Pros Concave (simple) polygons Constant time processing of an event Cons High quantity of crossing events Future Work What about 3d ?

iMAGIS-GRAVIR / IMAG A simple kinetic visibility polygon Thank you for your attention Any questions ?