Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 9228423
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 18, 20262026-06-18T05:19:13+00:00 2026-06-18T05:19:13+00:00

Possible Duplicate: Finding the overlapping area of two rectangles (in C#) I have two

  • 0

Possible Duplicate:
Finding the overlapping area of two rectangles (in C#)

I have two areas identified by top left and bottom right corners (fig.1).

In c#, how can I test if they are in contact (fig.2)?

enter image description here

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-18T05:19:15+00:00Added an answer on June 18, 2026 at 5:19 am

    Let’s say you have two Rectangles which are r1 and r2, you can check whether they intersects with each other by this:

    if(r1.IntersectsWith(r2))
    {
        // Intersect
    }
    

    If you need the exact area which they intersects with each other, you can do this:

    Rectangle intersectArea = Rectangle.Intersect(r1, r2);
    

    You can check the documentation: Rectangle.IntersectsWith, Rectangle.Intersect


    Additional important note:

    I’ve just checked that if the two rectangles just touch each other on an edge, Rectangle.Intersect returns a rectangle with one dimension is zero , however Rectangle.IntersectsWith will return false. So you need to note that.

    For example, Rectangle.Intersect on {X=0,Y=0,Width=10,Height=10} and {X=10,Y=0,Width=10,Height=10} will return {X=10,Y=0,Width=0,Height=10}.

    If you hope to get true also if they just touch each other, change the condition to:

    if(Rectangle.Intersect(r1, r2) != Rectangle.Empty)
    {
        // Intersect or contact (just touch each other)
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Possible Duplicate: Python: Finding corresponding indices for an intersection of two lists I have
Possible Duplicate: optimal algorithm for finding unique divisors I have asked this question before,
Possible Duplicate: Finding all cycles in graph I have a task I've been wrapping
Possible Duplicate: Finding an enum value by its Description Attribute I have a generic
Possible Duplicate: Finding the index of a list in a loop Assume you have
Possible Duplicate: Finding the type of an object in C++ I have a question
Possible Duplicate: Finding the N th Occurrence of a Match line I have multi-line
Possible Duplicate: Finding a submatrix with the maximum possible sum in O(n^2) I have
Possible Duplicate: Collision detection between two general hexahedrons Right now I do collision detection
Possible Duplicate: iphone 5 simulator - Cannot click on bottom of screen? I have

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.