tags:

views:

367

answers:

1
+1  Q: 

Fast Method to Intersect two Integer Quadratic Beziers?

Given two Quadratic Beziers in 2D with integer coordinates, what is the best way to find their intersection point(s)? Also interesting is an early rejection if they do not intersect. If it makes it easier, they can both be assumed to be monotone in both x and y. Only intersections that are representable by subdivision to integers of the input curves are valid.

+2  A: 

This document explains various methods for finding the intersection of curves.

strager  2009-01-16 04:10:39

related questions

How to parse a month name (string) to an integer for comparison in C#?
Read 64 bit integer string from file
Signed versus UnSigned Integers
Which is the best way to compare the integer part of two non-integer numbers?
How can I fit a curve to a histogram distribution?
Finding numerical substrings mathematically, without string comparison.
Alternative to itoa() for converting integer to string C++?
Convert Byte Array to Integer In VB.Net
Convert a number to a string with specified length in C++
What type for an integer of more than 4 bytes?
Calling a C# web service from with PHP with a long parameter
Integer formatting, padding to a given length
What is the proper size for a sequence-generated primary key?
On 32-bit CPUs, is an 'integer' type more efficient than a 'short' type?
How do I check if an integer is even or odd?
What does "0 but true" mean in Perl?
Best algorithm to count the number of set bits in a 32-bit integer?
Why don't languages raise errors on integer overflow by default?
Simplest way to check if two integers have same sign?
Bit reversal of an integer, ignoring integer size and endianness
Populating a list of integers in .NET
Arithmetic with Arbitrarily Large Integers in PHP
How to keep a "things done" count in a recursive algorithm in Java?
Java: Best way of converting List<Integer> to List<String>
C# Convert Integers into Written Numbers