Joe Waxmonsky, PE InRoads Product Manager End Conditions in Template Creation.

Slides:



Advertisements
Similar presentations
Informed search algorithms
Advertisements

What is a Database By: Cristian Dubon.
A* Search. 2 Tree search algorithms Basic idea: Exploration of state space by generating successors of already-explored states (a.k.a.~expanding states).
Patrick Evans, P.E. Senior Advisory Pre-Sales Technical Support Rep Superelevation in the Roadway Designer.
GeoPak Ver Update New Criteria Enhancements since last year. Using Backslope Override and the Backslope Constraint Line(BCL)
Games & Adversarial Search Chapter 5. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent’s reply. Time.
Patrick Evans, P.E. Senior Advisory Pre-Sales Technical Support Rep Target Aliasing Clipping Corridor Point Control - When and Where.
Patrick Evans, P.E. Senior Advisory Pre-Sales Technical Support Rep Introduction to Component Display Rules.
Linear Buckling Workshop 7. Workshop Supplement Linear Buckling August 26, 2005 Inventory # WS7-2 Workshop 7 - Goals The goal in this workshop is.
Presented By: Chuck Lawson, PE Paving the Way for Roadway Designer in GEOPAK V8 i (SELECTseries 1)
Using OpenRoads Effectively
CPSC 231 B-Trees (D.H.)1 LEARNING OBJECTIVES Problems with simple indexing. Multilevel indexing: B-Tree. –B-Tree creation: insertion and deletion of nodes.
SchemaLogic Workshop Part 2 Tools for Enterprise Metadata Management and Synchronization Prepared for the University of Washington Information School Applied.
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
CHAPTER 10 Recursion. 2 Recursive Thinking Recursion is a programming technique in which a method can call itself to solve a problem A recursive definition.
The Unified Modeling Language (UML) Class Diagrams.
CPSC 335 BTrees Dr. Marina Gavrilova Computer Science University of Calgary Canada.
5.6 Daily Warm-Up 7.1 Daily Warm-Up
Do Now - Review Find the solution to the system of equations: x – y = 3 x + y = 5.
Artificial Intelligence Lecture 9. Outline Search in State Space State Space Graphs Decision Trees Backtracking in Decision Trees.
+ The Practice of Statistics, 4 th edition – For AP* STARNES, YATES, MOORE Chapter 6: Probability: What are the Chances? Section 6.3 Conditional Probability.
Tips & Tricks for Revit® 2013
TECH 104 – Technical Graphics Communication Week 13: 3D Modeling Basics.
A.P. STATISTICS LESSON 6.3 ( DAY 2 ) GENERAL PROBABILITY RULES ( EXTENDED MULTIPLICATION RULES )
Date Roadway Designer Resurfacing Restoration and Rehabilitation Kevin Jackson, Technical Director, TLI Bentley Systems, Inc.
© 2009 Bentley Systems, Incorporated Corey Johnson-Bentley Intersection Design with Roadway Designer.
Database Design Using Entity-Relationship Models Transformation of Entity-Relationship Models into Relational Database Design Trees, Networks, and Bills.
Systems of Linear Equations Using a Graph to Solve.
Copyright © Cengage Learning. All rights reserved. 7.1 Solving Systems of Equations.
© 2009 Bentley Systems, Incorporated Richard W. Bradshaw Director of Development – Rail Design Modeling with Bentley Rail.
Actors and Use Case Diagrams Month Day, Year. Agenda Training Plan Overview Review Detailing Requirements with Requisite Pro Concepts Setting Up XDE Integration.
Tree Diagrams  Be able to use a tree diagram to list the possible outcomes from two events.  Be able to calculate probabilities from tree diagrams. 
Chapter 3 Creating and Editing Sketched Features.
Chapter 7 Advanced Part Modeling Techniques. After completing this chapter, you will be able to perform the following: –Extrude an open profile –Create.
4 th Tuesday – CAD Training Call-in Info: (865) , PIN: Topic – InRoads XM:  Updates Getting updated/new styles and preferences into an.
© 2012 Bentley Systems, Incorporated Moving to Civil V8i Select Series 3 Robert Garrett, Bentley Systems Inc. Product Manager.
© 2014 Bentley Systems, Incorporated Templates 202 Presented by: Chuck Lawson, PE Bentley Systems, Inc.
Do now You are driving to visit a friend in another state who lives 440 miles away. You are driving 55 miles/hour and have already driven 275 miles.
SEM Basics 2 Byrne Chapter 2 Kline pg 7-15, 50-51, ,
© 2009 Bentley Systems, Incorporated Thomas Taylor, Bentley Civil EW-14 Exploring Template Constraints and Display Rules.
Using Substitution – Solve the system of linear equations. 1.
Multiple ways to add and subtract I am learning to use multiplication and division to solve addition and subtraction problems.
Presented by: Chuck Lawson, PE Best Practices In Roadway Designer.
Chapter 3 Creating and Editing Sketched Features
Warm up Solve for y 1. 3x + 2y = x – 2y = x + 3y = -15 Write an equation in slope intercept form 4. m = 4 and y int (0, 3) 5. m = -3/2 and.
February 11, 2016Introduction to Artificial Intelligence Lecture 6: Search in State Spaces II 1 State-Space Graphs There are various methods for searching.
Solving Equations with Variable on Both Sides Objective: Students will solve equations with variables on both sides. Section 3.4.
Wes Preston DEV 202. Audience: Info Workers, Dev A deeper dive into use-cases where client-side rendering (CSR) and SharePoint’s JS Link property can.
Solving Systems of Equations The Elimination Method.
+ Section 5.2 Probability Rules After this section, you should be able to… DESCRIBE chance behavior with a probability model DEFINE and APPLY basic rules.
Chapter 7 Advanced Part Modeling Techniques. After completing this chapter, you will be able to perform the following: –Extrude an open profile –Create.
Properties of Transformations. Translate Figures and Use Vectors Translation: moves every point of a figure the same distance in the same direction Image:
TECH 104 – Technical Graphics Communication Week 12: 3D Modeling Basics.
Chapter 4 Some basic Probability Concepts 1-1. Learning Objectives  To learn the concept of the sample space associated with a random experiment.  To.
Linear Systems Systems of Equations Solve by Graphing Solve by Substitution Solve by Elimination Applications of Systems.
What are today’s objectives ?
Logical Database Design and the Rational Model
Chapter 4 Creating Placed Features
Linear Inequalities and Systems of Linear Inequalities
7.1 Solving Systems of Equations by Graphing
(edited by Nadia Al-Ghreimil)
Warm-up: Simplify: Solve: 1) (3x + 2y) – 2(x + y) 2) y2 + (y – 2)2 = 2
Warm-Up What do you have to do to make this problem solvable?
Using the Properties Together
Work Features Work features are tools that help create and position features by providing points, lines, and planes when current geometry is not sufficient.
5.3 Continued.
Solve Systems of Equations by Graphing
Work Features Work features are tools that help create and position features by providing points, lines, and planes when current geometry is not sufficient.
HW 13: red text p. 415 #s 1 – 12. y = x 2. y = -x slope = 1 slope = -1
3.6 Systems with Three Variables
Presentation transcript:

Joe Waxmonsky, PE InRoads Product Manager End Conditions in Template Creation

Agenda: End Condition Defined Anatomy EC Points & Segments End Conditions Working Together The Processing of EC’s Special Tools –Testing EC’s with Do Not Constructs –Parent/Child Components –External Controls –Display Rules Q&A

Definition of an End Condition Special Component –Exists in ITL & IRD Files Non-Closed Component Seeks/Targets –Surfaces –Geometry –Features –Elevations More than Cut & Fill –Test for Existence

Anatomy of an End Condition One or More Segments End Condition Properties –Check for Interception –Place Point at Interception –End Condition is Infinite –Do Not Construct Constraints –Define Guidelines…Vector –Sets Limits

Anatomy of an End Condition Template Testing a Single EC –Verify Results

Constraints and End Conditions What constraints are created when End Conditions are placed? –Horizontal and Slope constraints are placed by default –However, if the point is place by keyin, the constraints will match the keyin. Will changing these constraints affect the way the End Condition is solved? –Not directly, but it can affect behavior when an external control is applied.

Constraints and End Conditions End Condition components are first placed and then solved. Constraints can only affect how an End Condition is placed, not how it is solved. The solution to an End Condition is solved by finding the interception of the End Condition, as it is placed, and its target.

The solution of an End condition will be along the path of the end condition as it was placed. Even if the solution affects the location of the end condition itself

How are End Conditions solved? What happens when an End Condition is successful? –The beginning points of all End Conditions attached to the end of the solved End Condition are transformed to the intersection and processing of the End Condition tree continues.

End Condition Working Together End Conditions –Multiple EC’s work as a Group “Group” of End Conditions –One Start Point Typically 2 Start Points –Left/Right –No Limit to Start Points

End Condition Working Together End Condition Group= EC Tree Trunk=Start Point Branch=Decision Branch Priorities –Priority/Cost Effective Engr.

The Processing of EC’s Order of Operation Start Point(s) are Determined –Selection Random –Any EC 1 st Point Not Attached to Another EC EC’s at Start Points are solved –Sequential/Segments Multiple Points –Priority Setting

Trees, Paths, Branching and Priorities An End Condition tree is the collection of all End Conditions attached, directly or indirectly, to a start point.

Trees, Paths, Branching and Priorities An End Condition tree is the collection of all End Conditions attached to a start point. An End Condition path is the line traced from the start point of a tree to any one of the tree end points.

Trees, Paths, Branching and Priorities An End Condition tree is the collection of all End Conditions attached to a start point. An End Condition path is the line traced from the start point of a tree to any one of the tree end points. A branch occurs where more than one End Condition starts at the same point of a tree.

Trees, Paths, Branching and Priorities An End Condition tree is the collection of all End Conditions attached to a start point. An End Condition path is the line traced from the start point of a tree to any one of the tree end points. A branch occurs where more than one End Condition starts at the same point of a tree. When a branch is reached, priorities determine which End Condition to try first.

2 1 3

Trees, Paths, Branching and Priorities An End Condition tree is the collection of all End Conditions attached to a start point. An End Condition path is the line traced from the start point of a tree to any one of the tree end points. A branch occurs where more than one End Condition starts at the same point of a tree. When a branch is reached, priorities determine which End Condition to try first. An End Condition tree is successful when one path is successful. Which means each End Condition in the path must be successful.

Trees, Paths, Branching and Priorities An End Condition tree is the collection of all End Conditions attached to a start point. An End Condition path is the line traced from the start point of a tree to any one of the tree end points. A branch occurs where more than one End Condition starts at the same point of a tree. When a branch is reached, priorities determine which End Condition to try first. An End Condition tree is successful when one path is successful. Which means each End Condition in the path must be successful. Benching is an Exception to this rule.

A Benching End Condition is successful when the end condition attached to it is successful.

Testing EC’s with Do Not Constructs Do Not Construct Point Property Examples –ROW –Presence of a Feature –Cut/Fill Depth

Parent/Child Components Child components are components that are only displayed if their parent is displayed Children of the End Condition will still be displayed even if the End Condition itself is not (because of Do Not Construct flags NOT Display Rules) as long as the End Condition is successful. The use of child components greatly enhances End Conditions.

Cut3 does not show up in this diagram because of Do Not Construct flags on its points. Children of Cut3

Solving a Complex End Condition Minimum Depth Ditch…1’ –Accommodate Freeboard Determine the End Condition path. Add additional components to get the final solution. Test case.

1.0 min

Child of Cut Child of Fill

End Conditions and External Controls How can external controls affect End Condition solutions? –Just like constraints, external controls can affect the location and solution of End Conditions. –Remember that external controls take precedence over constraints when a design is being processed.

End Conditions and Display Rules Be very careful when combining Display Rules with End Conditions All End Conditions are solved BEFORE Display Rules are processed In other words, even if an end condition is not displayed because of a display rule, it is still solved, so don’t try to control end condition processing with display rules.

Summary End Conditions can be used to solve very simple to very complex situations in a design. End Conditions are placed first and then solved. End Conditions can actually start anywhere and travel in any direction. There is no limit to the number of End Condition start points on a template. End Condition use is not limited to tying the design to the existing surface. It is important to understand how End Conditions are solved to be able to utilize all of their capabilities.

Thank You Making IT Strategic to Your Business