Search Results

Search found 74 results on 3 pages for 'theorem'.

Page 1/3 | 1 2 3  | Next Page >

• Trying to detect collision between two polygons using Separating Axis Theorem

  - by Holly

  The only collision experience i've had was with simple rectangles, i wanted to find something that would allow me to define polygonal areas for collision and have been trying to make sense of SAT using these two links Though i'm a bit iffy with the math for the most part i feel like i understand the theory! Except my implementation somewhere down…

  Read the article

• Error in my Separating Axis Theorem collision code

  - by Holly

  The only collision experience i've had was with simple rectangles, i wanted to find something that would allow me to define polygonal areas for collision and have been trying to make sense of SAT using these two links Though i'm a bit iffy with the math for the most part i feel like i understand the theory! Except my implementation somewhere down…

  Read the article

• What's your favourite assisted theorem prover?

  - by Danny King

  Hi all, I'm hoping to pick one of the many assisted theorem provers (rather than automatic ones) but there are rather a lot to choose from! Does anyone have any you prefer and may I ask why? Thanks!

  Read the article

• Need explanation on theorem form the book [closed]

  - by Pradeep

  I need some explanation on amortization analysis with respect to analysis of algorithm. I need some more explanation on one of the theorem attached. Explanation needed: 1. How did the author derive at Mij is O (ij-ij-1)? 2. Need explanation for quoted from the book " because at most ij-ij-1 -1 elements have been added into the table since the…

  Read the article

• How do I change the block template for specific theorem environments (LaTeX beamer)

  - by Matthew Leingang

  The amsthm theorem environments (theorem,example,proof,solution,...) make blocks on beamer slides. The default is that example environments use a different template (block example) than theorem or solution or proof (block). How do I make solution use a different template like "block solution" that I can define?

  Read the article

• Azure, SLAs and CAP theorem

  - by dayscott

  Azure itself is imo PaaS and not IaaS. Do you agree? MS gurantees an availability of 99% and a strong consistency. You can find MS SLAs here: http://www.microsoft.com/windowsazure/sla (three SLAs Uptime: http://img229.imageshack.us/img229/4889/unbenanntqt.png ) I can't find anyhing about how they are going to archive that. Do they do…

  Read the article

• 2D game collision response: SAT & minimum displacement along a given axis?

  - by Archagon

  I'm trying to implement a collision system in a 2D game I'm making. The separating axis theorem (as described by metanet's collision tutorial) seems like an efficient and robust way of handling collision detection, but I don't quite like the collision response method they use. By blindly displacing along the axis of least overlap, the…

  Read the article

• Narrow-phase collision detection algorithms

  - by Marian Ivanov

  There are three phases of collision detection. Broadphase: It loops between all objecs that can interact, false positives are allowed, if it would speed up the loop. Narrowphase: Determines whether they collide, and sometimes, how, no false positives Resolution: Resolves the collision. The question I'm asking is about the…

  Read the article

• Debugging Minimum Translation Vector

  - by SyntheCypher

  I implemented the minimum translation vector from codezealot's tutorial on SAT (Separating Axis Theorem) but I'm having an issue I can't quite figure out. Here's the example I have: As you can see in top and bottom left images regardless of the side the of the green car which red car is penetrating the MTV for the red car…

  Read the article

• about Master theorem

  - by matin1234

  Hi this is the link http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic5/ is written that for T(n)<=2n+T(n/3)+T(n/3) the T(n) is not O(n) but with master theorem we can use case 3 and we can say that its T(n) is theta(n) please help me! thanks how can we prove that T(n) is not O(n)

  Read the article

• Collision detection with multiple polygons simultaneously

  - by Craig Innes

  I've written a collision system which detects/resolves collisions between a rectangular player and a convex polygon world using the Separating Axis Theorem. This scheme works fine when the player is colliding with a single polygon, but when I try to create a level made up of combinations of these shapes, the player gets…

  Read the article

• Collision Detection with SAT: False Collision for Diagonal Movement Towards Vertical Tile-Walls?

  - by Macks

  Edit: Problem solved! Big thanks to Jonathan who pointed me in the right direction. Sean describes the method I used in a different thread. Also big thanks to him! :) Here is how I solved my problem: If a collision is registered by my SAT-method, only fire the collision-event on my character if there are no…

  Read the article

• Trouble with SAT style vector projection in C#/XNA

  - by ssb

  Simply put I'm having a hard time working out how to work with XNA's Vector2 types while maintaining spatial considerations. I'm working with separating axis theorem and trying to project vectors onto an arbitrary axis to check if those projections overlap, but the severe lack of XNA-specific help online…

  Read the article

• Why do we use the Pythagorean theorem in game physics?

  - by Starkers

  I've recently learned that we use Pythagorean theorem a lot in our physics calculations and I'm afraid I don't really get the point. Here's an example from a book to make sure an object doesn't travel faster than a MAXIMUM_VELOCITY constant in the horizontal plane: MAXIMUM_VELOCITY = <any…

  Read the article

• Project ideas for automated deduction/automated theorem proving?

  - by wsh

  Dear Stack Overflow brethren, I'm a second-semester junior who will embark upon my thesis soon, and I have an interest in automated deduction and automated theorem provers. As in, I'd like to advance the art in some way (I don't mean that pretentiously, but I do want to do something…

  Read the article

• The Immerman-Szelepcsenyi Theorem

  - by Daniel Lorch

  In the Immerman-Szelepcsenyi Theorem, two algorithms are specified that use non-determinisim. There is a rather lengthy algorithm using "inductive counting", which determines the number of reachable configurations for a given non-deterministic turing machine. The algorithm looks like…

  Read the article

• iPhone SDK math - pythagorean theorem problem!

  - by Flafla2

  Just as a practice, I am working on an app that solves the famous middle school pythagorean theorem, a squared + b squared = c squared. Unfortunately, the out-coming answer has, in my eyes, nothing to do with the actual answer. Here is the code used during the "solve" action. -…

  Read the article

• Four-color theorem in Prolog (using a dynamic predicate)

  - by outa

  Hi, I'm working on coloring a map according to the four-color theorem (http://en.wikipedia.org/wiki/Four_color_theorem) with SWI-Prolog. So far my program looks like this: colour(red). colour(blue). map_color(A,B,C) :- colour(A), colour(B), colour(C), …

  Read the article

• How can I solve this SAT edge case?

  - by ssb

  I have an SAT implementation that basically works, and the fact that it works is what's giving me a few headaches. Basically there are some situations where using the SAT doesn't quite give me my intended result. One of these involves movement across multiple collision objects. Or…

  Read the article

• Need help with implementing collision detection using the Separating Axis Theorem

  - by Eddie Ringle

  So, after hours of Googling and reading, I've found that the basic process of detecting a collision using SAT is: for each edge of poly A project A and B onto the normal for this edge if intervals do not overlap, return false end for for each edge of poly B project A…

  Read the article

• How can I solve this SAT direct corner intersection edge case?

  - by ssb

  I have a working SAT implementation, but I am running into a problem where direct collisions at a corner do not work for tiled surfaces. That is, it clips on the surface when going in a certain direction because it gets hung up on one of the tiles, and so, for example, if I walk…

  Read the article

• Referencing a theorem-like environment by its [name]

  - by Seamus

  I am using ntheorem to typeset a set of conditions. In my preamble I have: \theoremstyle{empty} \newtheorem{Condtion}{Condtion} When I want to typeset a condition, I write: \begin{Condtion}[name] \label{cnd:nm} foo foo foo \end{Condition} The name appears boldface on the…

  Read the article

• AABB vs OBB Collision Resolution jitter on corners

  - by patt4179

  I've implemented a collision library for a character who is an AABB and am resolving collisions between AABB vs AABB and AABB vs OBB. I wanted slopes for certain sections, so I've toyed around with using several OBBs to make one, and it's working great except for one glaring…

  Read the article

• How can I get accurate collision resolution on the corners of rectangles?

  - by ssb

  I have a working collision system implemented, and it's based on minimum translation vectors. This works fine in most cases except when the minimum translation vector is not actually in the direction of the collision. For example: When a rectangle is on the far edge on…

  Read the article

• What is going on in this SAT/vector projection code?

  - by ssb

  I'm looking at the example XNA SAT collision code presented here: http://www.xnadevelopment.com/tutorials/rotatedrectanglecollisions/rotatedrectanglecollisions.shtml See the following code: private int GenerateScalar(Vector2 theRectangleCorner, Vector2 theAxis) { …

  Read the article

1 2 3  | Next Page >