I want to check if a specified coordinate is inside an area enclosed by a Bezier curve. Is there specific function in GDI I can use? If no, how could I do this manually? My Bezier curve sets by its points.
Check if a point belongs to area enclosed by Bezeir curve using GDI
222 Views Asked by Andrey Nekrasov At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in GDI
- GdiplusStartup fails with GenericError when called from within splwow64 but not others
- Getting a ListView in Report mode to work on a dialog with WS_EX_COMPOSITED?
- Two questions about SetPixel() and multithreading
- Is there some problem with undoActions that prevents my two functions( redo and undo from working properly)
- Win32 GDI Brush object
- GDI+ screenshot doesn't work with odd resolutions
- Graphics - Drawing lines are not even. Rounding errors converting single to integer?
- StretchBlt function returns a weird white dots bitmap
- Issues Running C# Code with ILGPU for GPU Acceleration
- Converting true color(32 bit) HBITMAP into monochrome bitmap (e.g 1 bit) in Winapi
- How to Convert Xamarin ImageSource to a Format for Pixel Manipulation (e.g., SkiaSharp or GDI)?
- Calc text width, JS vs Windows graphics
- Win32 - Drawing a native window with a specific style
- Translating Windows Forms Drawing Logic to Xamarin.Forms with SkiaSharp
- how to create dynamically Point point[] to use in (place the x, y values from computation within a for loop)
Related Questions in HIT
- Phaser Hit boxes are invisibly to the right, what gives?
- how do I make my javascript program to ask user to hit any key to exit?
- Get the index of the first element in an array that meets the specified condition
- Create a new value output if the values of another column do not match
- I am trying to create a hit using html file for amazon mturk
- not able to use hit detection while using pygame and tkinter together
- How to print the best matching hit in the BLAST search? / BioPython
- How to add a click event on amchart NavigationBar?
- How select hits composed entirely of Compton scattering events?
- 'Old fashioned' hit counter
- Regular expression to limit the character found to 2 or 3 not more
- How to understand when a activerecord query is executed?
- Different Counter Value for Each Page on Website
- scanf without newline (C programming)
- Hit detection between 2 moving objects in CreateJS
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
How much queries are you going to do?
If performance is not very important, you may create GDI region and check whether point is inside:
If there are many query points, it would better to make analytic solution - calculate the number of intersections of (horizontal) ray from point with Bezier curve (cubic equation solution is needed). If this number is odd - point is inside (there are some subtleties with double roots on curve cusps etc)