Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

In this paper we provide an analytical description of various classes of digital circles, spheres and in some cases hyperspheres… Expand

Is this relevant?

2010

2010

A* on grid maps generates a path with zig-zag pattern as shown in Figure 1(a). Theta* had been proposed to produce a natural and… Expand

Is this relevant?

2008

2008

Bresenham algorithm is the most fundamental algorithm for drawing line segments in computer graphics. Canonical Bresenham… Expand

Is this relevant?

2005

2005

Digitization of a real circle is defined as the set of closest pixels (integer lattice points) to the circle. These pixels form a… Expand

Is this relevant?

2004

2004

Many of commercially available circuits for CNC machines have digitized input so there is a need to map continuous motions onto… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Abstract This paper presents a new approach to discrete circles, rings, and an immediate extension to spheres. The circle, called… Expand

Is this relevant?

1991

1991

The line segment is the basic entity in virtually all computer graphics systems. J.E. Bresenham's algorithm (1965) efficiently… Expand

Is this relevant?

1990

1990

Parallel algorithm for line and circle drawing that are based on J.E. Bresenham's line and circle algorithms (see Commun. ACM… Expand

Is this relevant?

1989

1989

• HDMI input is interfaced with the Zynq zc702 through FMC Imageon card. The input resolution is 1980x1080 with frame rate of… Expand

Is this relevant?

1982

1982

Bresenham's algorithm is well known as an efficient and elegant control program for drawing a best fit approximation to straight… Expand

Is this relevant?