Skip to main content

Terms and conditions

Terms and conditions


These terms and conditions ("Terms", "Agreement") are an agreement between Website Operator ("Website Operator", "us", "we" or "our") and you ("User", "you" or "your"). This Agreement sets forth the general terms and conditions of your use of the getsetcg.com website and any of its products or services (collectively, "Website" or "Services").

Backups


We are not responsible for Content residing on the Website. In no event shall we be held liable for any loss of any Content. It is your sole responsibility to maintain appropriate backup of your Content. Notwithstanding the foregoing, on some occasions and in certain circumstances, with absolutely no obligation, we may be able to restore some or all of your data that has been deleted as of a certain date and time when we may have backed up data for our own purposes. We make no guarantee that the data you need will be available.

Advertisements


During use of the Website, you may enter into correspondence with or participate in promotions of advertisers or sponsors showing their goods or services through the Website. Any such activity, and any terms, conditions, warranties or representations associated with such activity, is solely between you and the applicable third-party. We shall have no liability, obligation or responsibility for any such correspondence, purchase or promotion between you and any such third-party.

Intellectual property rights


This Agreement does not transfer to you any intellectual property owned by Website Operator or third-parties, and all rights, titles, and interests in and to such property will remain (as between the parties) solely with Website Operator. All trademarks, service marks, graphics and logos used in connection with our Website or Services, are trademarks or registered trademarks of Website Operator or Website Operator licensors. Other trademarks, service marks, graphics and logos used in connection with our Website or Services may be the trademarks of other third-parties. Your use of our Website and Services grants you no right or license to reproduce or otherwise use any Website Operator or third-party trademarks.

Limitation of liability


To the fullest extent permitted by applicable law, in no event will Website Operator, its affiliates, officers, directors, employees, agents, suppliers or licensors be liable to any person for (a): any indirect, incidental, special, punitive, cover or consequential damages (including, without limitation, damages for lost profits, revenue, sales, goodwill, use or content, impact on business, business interruption, loss of anticipated savings, loss of business opportunity) however caused, under any theory of liability, including, without limitation, contract, tort, warranty, breach of statutory duty, negligence or otherwise, even if Website Operator has been advised as to the possibility of such damages or could have foreseen such damages. To the maximum extent permitted by applicable law, the aggregate liability of Website Operator and its affiliates, officers, employees, agents, suppliers and licensors, relating to the services will be limited to an amount greater of one dollar or any amounts actually paid in cash by you to Website Operator for the prior one month period prior to the first event or occurrence giving rise to such liability. The limitations and exclusions also apply if this remedy does not fully compensate you for any losses or fails of its essential purpose.

Changes and amendments


We reserve the right to modify this Agreement or its policies relating to the Website or Services at any time, effective upon posting of an updated version of this Agreement on the Website. When we do we will post a notification on the main page of our Website. Continued use of the Website after any such changes shall constitute your consent to such changes. Policy was created with WebsitePolicies.com

Acceptance of these terms


You acknowledge that you have read this Agreement and agree to all its terms and conditions. By using the Website or its Services you agree to be bound by this Agreement. If you do not agree to abide by the terms of this Agreement, you are not authorized to use or access the Website and its Services.

Contacting us


If you have any questions about this Agreement, please contact us.

Popular posts from this blog

Interactive Vs Non-Interactive Graphics

There are 2 types of Computer Graphics                     Interactive: Here user can engage with graphics i.e. it is two way communication between user and graphics. example : video games Non-Interactive: Here user cannot engage with graphics. It is one way communication user can only watch graphical activity without any interaction. example : TV broadcasting Interactive Graphics    Non-Interactive graphics      User interaction is required     The user has full control over     the  content                                                     Programmed in a way that user can   control   graphic    Examples :       Simulators (training pilots)       Video games       User Interface           User interaction is not required     The user only has control over     some parts  of   the content     Passive, totally controlled by     the Program  Examples:     Videos, m
5 comments
Read more

Bresenham's Line Drawing Derivation

Bresenham's Line Drawing Algorithm Derivation Bresenham Line drawing algorithm is used to determine closest points to be illuminated on the screen to form a line. As we know a line is made by joining 2 points, but in a computer screen, a line is drawn by illuminating the pixels on the screen. (Here pixel (1,2), (3,1) and (5,5) are illuminated and others are non-illuminated) A line from pixel (2,2) to (7,5) will be shown like this on the screen. The slope of a line plays a major role in the line equation that's why Bresenham line drawing algorithm calculates the equation according to the slope of the line. The slope of the line can be greater than 1 (m>1) or less than or equal to 1 (m<=1). Now enough talking let's derive the equations. Derivation: Let's say we want to draw a line on the screen. so, to draw a line we have to calculate the points or pixels to be illuminated on the screen. Now while drawing a line a som
8 comments
Read more

Bresenham's Circle Drawing Derivation

Bresenham's Circle Drawing Algorithm Derivation Bresenham circle drawing algorithm is used to determine the next pixel of screen to be illuminated while drawing a circle by determining the closest nearby pixel. Let us first take a look how a circle is drawn on a pixel screen (this is how pixel graph is represented) As Circles are symmetrical so the values of y-intercept and x-intercept are are same if circle's Center coordinates are at Origin (0,0). Here,  Radius = OA = r Due to symmetrical property of Circle we don't need to calculate all the pixels of all the octets and quadrants We need to find the pixels of only one octet, rest we can conclude through this. Lets take the Octet 2 which is in quadrant 1 here both x and y are positive here the initial pixel would be (0,y) coordinate At point R both the value of both x and y coordinates would be same as R is at same distance of Both X and Y axis.
6 comments
Read more

Mid Point Circle Drawing Derivation

Mid Point Circle Drawing Derivation (Algorithm) The mid point circle algorithm is used to determine the pixels needed for rasterizing a circle while drawing a circle on a pixel screen. In this technique algorithm determines the mid point between the next 2 possible consecutive pixels and then checks whether the mid point in inside or outside the circle and illuminates the pixel accordingly. This is how a pixel screen is represented: A circle is highly symmetrical and can be divided into 8 Octets on graph. Lets take center of circle at Origin i.e (0,0) : We need only to conclude the pixels of any one of the octet rest we can conclude because of symmetrical properties of circle. Let us Take Quadrant 1:  Radius = OR = r Radius = x intercept = y intercept At point R       coordinate of x = coordinate of y     or we can say   x=y let us take Octet 2 of quadrant 1 here first pixel would be (0,y)             here value of y interce
5 comments
Read more